# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
592720 | 2022-07-09T13:59:45 Z | Blagojce | City Mapping (NOI18_citymapping) | C++11 | 9 ms | 8324 KB |
#include <bits/stdc++.h> #define fr(i, n, m) for(int i = (n); i < (m); i ++) #define st first #define nd second #define pb push_back #define pq priority_queue #define all(x) begin(x), end(x) using namespace std; typedef long long ll; typedef pair<int,int> pii; const int mxn = 1003; mt19937 _rand(time(NULL)); clock_t z; #include "citymapping.h" ll dist[mxn][mxn];/* ll get_distance(int x, int y){ cout<<"? "<<x<<' '<<y<<endl; ll ret; cin >> ret; return ret; }*/ ll ask(int x, int y){ if(x != y && dist[x][y] == 0){ dist[x][y] = dist[y][x] = get_distance(x+1, y+1); } return dist[x][y]; } vector<int> g; int R1, R2; int AA[mxn], BB[mxn], WW[mxn]; int edge_id = 0; void add_edge(int x, int y, int w){ AA[edge_id] = x; BB[edge_id] = y; WW[edge_id] = w; edge_id ++; } void decompose(vector<int> v, int r1){ //int r1 = v[_rand() % (int)v.size()]; g = v; if((int)g.size() <= 1) return; for(auto u : g){ ask(u, r1); } R1 = r1; sort(all(g), [](const int &i, const int &j){ return dist[R1][i] < dist[R1][j]; }); int r2 = g.back(); for(auto u : g){ ask(u, r2); } vector<int> diam; for(auto u : g){ if(dist[r1][u] + dist[u][r2] == dist[r1][r2]){ diam.pb(u); } } fr(i, 1, (int)diam.size()){ add_edge(diam[i-1], diam[i], dist[r1][diam[i]] - dist[r1][diam[i-1]]); } vector<int> sub[(int)diam.size()]; fr(i, 0, (int)diam.size()){ sub[i].pb(diam[i]); } for(auto u : g){ if(dist[r1][u] + dist[u][r2] == dist[r1][r2]) continue; fr(i, 0, (int)diam.size()){ auto d = diam[i]; if(dist[r1][u] - dist[r2][u] == dist[r1][d] - dist[r2][d]){ sub[i].pb(u); break; } } } fr(i, 0, (int)diam.size()){ int d = diam[i]; for(auto s : sub[i]){ dist[d][s] = dist[s][d] = dist[r1][s] - dist[r1][d]; if(dist[r1][s] > dist[r1][diam[i]]) diam[i] = s; } } fr(i, 0, (int)diam.size()){ decompose(sub[i], diam[i]); } } void find_roads(int N, int Q, int A[], int B[], int W[]) { vector<int> v; fr(i, 0, N) v.pb(i); decompose(v, _rand()%N); fr(i, 0, N-1){ A[i] = AA[i] + 1; B[i] = BB[i] + 1; W[i] = WW[i]; } return; }
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 7380 KB | Correct: 2141 out of 500000 queries used. |
2 | Correct | 6 ms | 8192 KB | Correct: 2786 out of 500000 queries used. |
3 | Correct | 6 ms | 8276 KB | Correct: 5160 out of 500000 queries used. |
4 | Correct | 6 ms | 8276 KB | Correct: 6001 out of 500000 queries used. |
5 | Correct | 6 ms | 8276 KB | Correct: 10196 out of 500000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 7380 KB | Correct: 2141 out of 500000 queries used. |
2 | Correct | 6 ms | 8192 KB | Correct: 2786 out of 500000 queries used. |
3 | Correct | 6 ms | 8276 KB | Correct: 5160 out of 500000 queries used. |
4 | Correct | 6 ms | 8276 KB | Correct: 6001 out of 500000 queries used. |
5 | Correct | 6 ms | 8276 KB | Correct: 10196 out of 500000 queries used. |
6 | Correct | 5 ms | 7892 KB | Correct: 2177 out of 500000 queries used. |
7 | Correct | 7 ms | 8324 KB | Correct: 13769 out of 500000 queries used. |
8 | Correct | 6 ms | 8276 KB | Correct: 5316 out of 500000 queries used. |
9 | Correct | 7 ms | 8276 KB | Correct: 6250 out of 500000 queries used. |
10 | Correct | 6 ms | 8276 KB | Correct: 4633 out of 500000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 6996 KB | Correct: 2465 out of 12000 queries used. |
2 | Correct | 4 ms | 6868 KB | Correct: 2006 out of 12000 queries used. |
3 | Correct | 5 ms | 8020 KB | Correct: 2158 out of 12000 queries used. |
4 | Correct | 5 ms | 7508 KB | Correct: 2004 out of 12000 queries used. |
5 | Correct | 5 ms | 7380 KB | Correct: 2012 out of 12000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 6996 KB | Correct: 2465 out of 12000 queries used. |
2 | Correct | 4 ms | 6868 KB | Correct: 2006 out of 12000 queries used. |
3 | Correct | 5 ms | 8020 KB | Correct: 2158 out of 12000 queries used. |
4 | Correct | 5 ms | 7508 KB | Correct: 2004 out of 12000 queries used. |
5 | Correct | 5 ms | 7380 KB | Correct: 2012 out of 12000 queries used. |
6 | Correct | 6 ms | 7164 KB | Correct: 2371 out of 12000 queries used. |
7 | Correct | 6 ms | 7260 KB | Correct: 2279 out of 12000 queries used. |
8 | Correct | 5 ms | 7124 KB | Correct: 2000 out of 12000 queries used. |
9 | Correct | 6 ms | 7124 KB | Correct: 2417 out of 12000 queries used. |
10 | Correct | 4 ms | 6996 KB | Correct: 2281 out of 12000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 7380 KB | Correct: 2141 out of 500000 queries used. |
2 | Correct | 6 ms | 8192 KB | Correct: 2786 out of 500000 queries used. |
3 | Correct | 6 ms | 8276 KB | Correct: 5160 out of 500000 queries used. |
4 | Correct | 6 ms | 8276 KB | Correct: 6001 out of 500000 queries used. |
5 | Correct | 6 ms | 8276 KB | Correct: 10196 out of 500000 queries used. |
6 | Correct | 5 ms | 7892 KB | Correct: 2177 out of 500000 queries used. |
7 | Correct | 7 ms | 8324 KB | Correct: 13769 out of 500000 queries used. |
8 | Correct | 6 ms | 8276 KB | Correct: 5316 out of 500000 queries used. |
9 | Correct | 7 ms | 8276 KB | Correct: 6250 out of 500000 queries used. |
10 | Correct | 6 ms | 8276 KB | Correct: 4633 out of 500000 queries used. |
11 | Correct | 4 ms | 6996 KB | Correct: 2465 out of 12000 queries used. |
12 | Correct | 4 ms | 6868 KB | Correct: 2006 out of 12000 queries used. |
13 | Correct | 5 ms | 8020 KB | Correct: 2158 out of 12000 queries used. |
14 | Correct | 5 ms | 7508 KB | Correct: 2004 out of 12000 queries used. |
15 | Correct | 5 ms | 7380 KB | Correct: 2012 out of 12000 queries used. |
16 | Correct | 6 ms | 7164 KB | Correct: 2371 out of 12000 queries used. |
17 | Correct | 6 ms | 7260 KB | Correct: 2279 out of 12000 queries used. |
18 | Correct | 5 ms | 7124 KB | Correct: 2000 out of 12000 queries used. |
19 | Correct | 6 ms | 7124 KB | Correct: 2417 out of 12000 queries used. |
20 | Correct | 4 ms | 6996 KB | Correct: 2281 out of 12000 queries used. |
21 | Correct | 5 ms | 7764 KB | Correct: 2009 out of 25000 queries used. |
22 | Correct | 6 ms | 8052 KB | Correct: 6083 out of 25000 queries used. |
23 | Correct | 6 ms | 8276 KB | Correct: 3726 out of 25000 queries used. |
24 | Correct | 6 ms | 7984 KB | Correct: 4133 out of 25000 queries used. |
25 | Correct | 6 ms | 8276 KB | Correct: 5297 out of 25000 queries used. |
26 | Correct | 5 ms | 8176 KB | Correct: 5272 out of 25000 queries used. |
27 | Correct | 7 ms | 8284 KB | Correct: 5541 out of 25000 queries used. |
28 | Correct | 6 ms | 8276 KB | Correct: 5370 out of 25000 queries used. |
29 | Correct | 6 ms | 8276 KB | Correct: 5712 out of 25000 queries used. |
30 | Correct | 8 ms | 8240 KB | Correct: 6002 out of 25000 queries used. |
31 | Correct | 6 ms | 8276 KB | Correct: 5968 out of 25000 queries used. |
32 | Correct | 5 ms | 7028 KB | Correct: 2289 out of 25000 queries used. |
33 | Correct | 8 ms | 8276 KB | Correct: 5919 out of 25000 queries used. |
34 | Correct | 6 ms | 8276 KB | Correct: 5938 out of 25000 queries used. |
35 | Correct | 5 ms | 8276 KB | Correct: 5993 out of 25000 queries used. |
36 | Correct | 6 ms | 8276 KB | Correct: 5956 out of 25000 queries used. |
37 | Correct | 6 ms | 8276 KB | Correct: 5901 out of 25000 queries used. |
38 | Correct | 6 ms | 8276 KB | Correct: 5974 out of 25000 queries used. |
39 | Correct | 6 ms | 8276 KB | Correct: 5994 out of 25000 queries used. |
40 | Correct | 7 ms | 8304 KB | Correct: 5991 out of 25000 queries used. |
41 | Correct | 6 ms | 8256 KB | Correct: 5950 out of 25000 queries used. |
42 | Correct | 6 ms | 8276 KB | Correct: 5973 out of 25000 queries used. |
43 | Correct | 6 ms | 8148 KB | Correct: 1995 out of 25000 queries used. |
44 | Correct | 7 ms | 8276 KB | Correct: 5921 out of 25000 queries used. |
45 | Correct | 9 ms | 8228 KB | Correct: 5942 out of 25000 queries used. |
46 | Correct | 8 ms | 8148 KB | Correct: 5892 out of 25000 queries used. |
47 | Correct | 6 ms | 8276 KB | Correct: 6013 out of 25000 queries used. |
48 | Correct | 6 ms | 8276 KB | Correct: 6000 out of 25000 queries used. |
49 | Correct | 6 ms | 8276 KB | Correct: 5985 out of 25000 queries used. |
50 | Correct | 6 ms | 8196 KB | Correct: 5995 out of 25000 queries used. |
51 | Correct | 6 ms | 8276 KB | Correct: 5968 out of 25000 queries used. |
52 | Correct | 6 ms | 8276 KB | Correct: 5955 out of 25000 queries used. |
53 | Correct | 6 ms | 8276 KB | Correct: 5989 out of 25000 queries used. |
54 | Correct | 6 ms | 8276 KB | Correct: 5760 out of 25000 queries used. |
55 | Correct | 6 ms | 8276 KB | Correct: 6280 out of 25000 queries used. |
56 | Correct | 6 ms | 8160 KB | Correct: 5925 out of 25000 queries used. |
57 | Correct | 6 ms | 8276 KB | Correct: 6035 out of 25000 queries used. |
58 | Correct | 6 ms | 8148 KB | Correct: 5873 out of 25000 queries used. |
59 | Correct | 6 ms | 8276 KB | Correct: 5923 out of 25000 queries used. |
60 | Correct | 5 ms | 8020 KB | Correct: 4629 out of 25000 queries used. |
61 | Correct | 6 ms | 8148 KB | Correct: 6989 out of 25000 queries used. |
62 | Correct | 7 ms | 7892 KB | Correct: 6151 out of 25000 queries used. |
63 | Correct | 7 ms | 8276 KB | Correct: 3741 out of 25000 queries used. |
64 | Correct | 6 ms | 8056 KB | Correct: 3070 out of 25000 queries used. |
65 | Correct | 6 ms | 7892 KB | Correct: 4113 out of 25000 queries used. |
66 | Correct | 6 ms | 8148 KB | Correct: 5067 out of 25000 queries used. |
67 | Correct | 7 ms | 8060 KB | Correct: 3067 out of 25000 queries used. |
68 | Incorrect | 9 ms | 8276 KB | Too many calls to get_distance(). |
69 | Halted | 0 ms | 0 KB | - |