| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 249487 |
2020-07-15T06:39:08 Z |
lyc |
Meetings (JOI19_meetings) |
C++14 |
|
2000 ms |
7028 KB |
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
using ii=pair<int,int>;
map<ii,int> memo;
int ask(int a, int b) {
if (memo.count(ii(a,b))) return memo[ii(a,b)];
return memo[ii(a,b)] = Query(0,a,b);
}
void answer(int a, int b) {
assert(a != b);
if (a > b) swap(a,b);
Bridge(a,b);
}
int ind[2005];
vector<int> al[2005];
void Solve(int N) {
FOR(i,1,N-1) FOR(j,i+1,N-1) {
int r = ask(i,j);
if (r != 0) al[0].push_back(r), ++ind[r];
if (r != i) al[r].push_back(i), ++ind[i];
if (r != j) al[r].push_back(j), ++ind[j];
}
queue<int> q;
q.push(0);
while (!q.empty()) {
int u = q.front(); q.pop();
for (int v : al[u]) {
if (--ind[v] == 0) {
q.push(v);
answer(u,v);
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
512 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| 16 |
Correct |
1 ms |
512 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
512 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| 16 |
Correct |
1 ms |
512 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
167 ms |
3828 KB |
Output is correct |
| 28 |
Correct |
163 ms |
3824 KB |
Output is correct |
| 29 |
Correct |
163 ms |
3704 KB |
Output is correct |
| 30 |
Correct |
166 ms |
3828 KB |
Output is correct |
| 31 |
Correct |
177 ms |
3700 KB |
Output is correct |
| 32 |
Correct |
183 ms |
3828 KB |
Output is correct |
| 33 |
Correct |
167 ms |
3824 KB |
Output is correct |
| 34 |
Correct |
160 ms |
3820 KB |
Output is correct |
| 35 |
Correct |
165 ms |
3804 KB |
Output is correct |
| 36 |
Correct |
174 ms |
3828 KB |
Output is correct |
| 37 |
Correct |
233 ms |
3828 KB |
Output is correct |
| 38 |
Correct |
267 ms |
3700 KB |
Output is correct |
| 39 |
Correct |
223 ms |
3704 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3089 ms |
7028 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
