# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
123804 |
2019-07-02T07:08:46 Z |
송준혁(#3032) |
Meetings (JOI19_meetings) |
C++14 |
|
2000 ms |
1020 KB |
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
vector<int> adj[2020];
bool chk[2020];
void add(int u, int p, int w){
for (int i=0; i<(int)adj[u].size(); i++){
if (adj[u][i] == p) continue;
int x = Query(u, adj[u][i], w);
if (x == u) continue;
else if (x == adj[u][i]){
add(adj[u][i], u, w);
return;
}
else{
chk[x] = true;
for (int j=0; j<(int)adj[adj[u][i]].size(); j++) if (adj[adj[u][i]][j] == u) adj[adj[u][i]][j] = x;
adj[x].push_back(u);
adj[x].push_back(adj[u][i]);
adj[u][i] = x;
if (x != w){
adj[x].push_back(w);
adj[w].push_back(x);
}
return;
}
}
adj[u].push_back(w);
adj[w].push_back(u);
}
void Solve(int N) {
for (int i=1; i<N; i++){
if (chk[i]) continue;
add(0, -1, i);
}
for (int u=0; u<N; u++) for (int v : adj[u]) if (u < v) Bridge(u, v);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
2 ms |
376 KB |
Output is correct |
17 |
Correct |
2 ms |
376 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
22 |
Correct |
2 ms |
376 KB |
Output is correct |
23 |
Correct |
2 ms |
376 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
2 ms |
376 KB |
Output is correct |
26 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
2 ms |
376 KB |
Output is correct |
17 |
Correct |
2 ms |
376 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
22 |
Correct |
2 ms |
376 KB |
Output is correct |
23 |
Correct |
2 ms |
376 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
2 ms |
376 KB |
Output is correct |
26 |
Correct |
3 ms |
376 KB |
Output is correct |
27 |
Correct |
10 ms |
504 KB |
Output is correct |
28 |
Correct |
9 ms |
504 KB |
Output is correct |
29 |
Correct |
10 ms |
504 KB |
Output is correct |
30 |
Correct |
10 ms |
504 KB |
Output is correct |
31 |
Correct |
7 ms |
380 KB |
Output is correct |
32 |
Correct |
9 ms |
376 KB |
Output is correct |
33 |
Correct |
14 ms |
376 KB |
Output is correct |
34 |
Correct |
18 ms |
632 KB |
Output is correct |
35 |
Correct |
17 ms |
504 KB |
Output is correct |
36 |
Correct |
11 ms |
376 KB |
Output is correct |
37 |
Correct |
49 ms |
504 KB |
Output is correct |
38 |
Correct |
64 ms |
504 KB |
Output is correct |
39 |
Correct |
165 ms |
472 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1118 ms |
632 KB |
Output is correct |
2 |
Correct |
1381 ms |
1020 KB |
Output is correct |
3 |
Correct |
1314 ms |
964 KB |
Output is correct |
4 |
Correct |
1420 ms |
768 KB |
Output is correct |
5 |
Correct |
795 ms |
680 KB |
Output is correct |
6 |
Correct |
620 ms |
632 KB |
Output is correct |
7 |
Correct |
801 ms |
800 KB |
Output is correct |
8 |
Correct |
807 ms |
976 KB |
Output is correct |
9 |
Correct |
1010 ms |
932 KB |
Output is correct |
10 |
Correct |
865 ms |
808 KB |
Output is correct |
11 |
Correct |
1010 ms |
936 KB |
Output is correct |
12 |
Execution timed out |
3046 ms |
776 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |