-
Notifications
You must be signed in to change notification settings - Fork 1
/
OIG1_BIT.cpp
executable file
·184 lines (136 loc) · 3.45 KB
/
OIG1_BIT.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
#include <sys/time.h>
#define FOR(i,a,b) for(long long i = a ; i < b ; ++i )
#define PB push_back
typedef unsigned long long int uint64_t;
const uint64_t mod = 1000000007LL;
using namespace std;
int odp = -1;
int * fromStart;
int * fromEnd;
struct element{ int start; int stop; int length; };
struct vert{ int dis; element x; };
class Compare
{
public:
bool operator() (vert a, vert b)
{
return a.dis > b.dis ;
}
};
int* dijkstra( vector< vector<element> >& edges, int start ){
int size = edges.size()-1, res;
int * dis = new int [ size+1 ];
int * odw = new int [ size+1 ];
vert ver;
element temp;
FOR( i, 1 , size+1 ){
dis[ i ] = -1; odw[ i ] = 0;
}
dis[ start ] = 0 ;
priority_queue< vert , vector<vert> , Compare> que;
ver.dis = 0 ;
temp.start = start; temp.stop = start; temp.length = 0 ;
ver.x = temp;
que.push( ver );
int counter = 0;
while( !que.empty() and counter <= size ) {
vert tmp = que.top();
que.pop();
if( odw[ tmp.x.stop ] == 0){
counter++;
for( vector<element>::iterator it= edges[tmp.x.stop].begin();it!=edges[tmp.x.stop].end();++it){
if( dis[ (*it).start ] + (*it).length < dis[ (*it).stop ] or dis[ (*it).stop ] == -1 ){
dis[ (*it).stop ] = dis[ (*it).start ] + (*it).length;
ver.x = (*it) ;
ver.dis = dis[ (*it).stop ];
que.push( ver );
}
}
odw[ tmp.x.stop ] = 1;
}
}
delete[] odw;
return dis;
}
void actualize(vector<vector<element> >& edges,int * tab , int start, element x, int size, int min ){
queue<int> que;
que.push( start );
tab[ start ] -= min;
while( !que.empty() ){
int temp = que.front();
que.pop();
for( vector< element >::iterator it = edges[ temp ].begin() ; it!=edges[temp].end(); ++it){
if( tab[ temp ] + (*it).length < tab[(*it).stop ] ){
tab[(*it).stop ] = tab[ temp ] + (*it).length;
que.push( (*it).stop );
}
}
}
}
int check(vector< vector<element> >& edges, element x ){
bool result = false;
int size = edges.size()-1, res;
if( fromStart[ x.stop] < fromStart[ x.start ] ) swap( x.start, x.stop );
if( fromStart[x.start] + x.length + fromEnd[ x.stop ] < fromStart[ size ] and fromStart[x.start] != - 1 and fromStart[ x.stop ] != -1 ){
int min = fromStart[ x.stop ] - fromStart[ x.start ] - x.length;
actualize( edges,fromStart , x.stop , x , size+1,min );
swap( x.start , x.stop );
min = fromEnd[ x.stop ] - fromEnd[ x.start ] - x.length;
actualize(edges, fromEnd , x.stop , x, size+1, min);
return 1;
}
return 0;
}
int main(){
int n;
int k;
int m;
int length;
int t;
int a;
int b;
int start;
int rodzaj;
int * takiDinks;
element x;
element temp;
ios_base::sync_with_stdio( false );
scanf("%d %d %d",&n,&k,&m);
vector< vector< element > > edges( n+1 );
FOR( i , 0 , k ){
scanf("%d %d %d",&a,&b,&length);
temp.start = a;
temp.stop = b;
temp.length = length;
edges[ a ].PB( temp );
swap ( temp.start, temp.stop );
edges[ b ].PB( temp );
}
fromStart = dijkstra( edges, 1 );
fromEnd = dijkstra( edges, n );
FOR( i , 0 , m ){
scanf("%d %d %d",&a,&b,&length);
x.start = a ;
x.stop = b ;
x.length = length;
if( check(edges, x) ){
edges[ a ].PB ( x );
swap( x.start, x.stop );
edges[ b ].PB( x );
swap( x.start, x.stop );
printf("1\n");
}
else {
printf("0\n");
}
}
return 0 ;
}