# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
203491 |
2020-02-21T02:36:38 Z |
t12345 |
Meetings (JOI19_meetings) |
C++14 |
|
408 ms |
262148 KB |
#include "meetings.h"
#include <algorithm>
#include <vector>
using namespace std;
vector<int> tr[305];
int vt[305], dg[305];
void f(int p) {
vt[p] = 1;
for(auto x:tr[p]) dg[x]--;
for(auto x:tr[p]) {
if(!dg[x] && !vt[x]) {
Bridge(min(x, p), max(x, p));
f(x);
}
}
}
void Solve(int N) {
int i, j, re;
for(i=1; i<N; i++) {
for(j=i+1; j<N; j++) {
re = Query(0, i, j);
if(re != i) tr[re].push_back(i);
if(re != j) tr[re].push_back(j);
}
}
for(i=0; i<N; i++) {
sort(tr[i].begin(), tr[i].end());
tr[i].erase(unique(tr[i].begin(), tr[i].end()), tr[i].end());
for(auto x:tr[i]) dg[x]++;
}
f(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Incorrect |
4 ms |
376 KB |
Wrong Answer [6] |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Incorrect |
4 ms |
376 KB |
Wrong Answer [6] |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Incorrect |
4 ms |
376 KB |
Wrong Answer [6] |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
408 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |