#include "meetings.h"
#include <vector>
#include <queue>
using namespace std;
int a[305][305];
bool v[305][305];
int b[305];
bool vv[305];
queue<int> qu;
void Solve(int N)
{
int n = N;
for(int i = 1; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
a[j][i] = a[i][j] = Query(0, i, j);
v[a[i][j]][i] = true;
v[a[i][j]][j] = true;
}
}
for(int i = 1; i < n; i++) v[0][i] = true;
for(int i = 0; i < n; i++)
{
vv[i] = true;
for(int j = 0; j < n; j++)
{
if(i != j)b[i] += v[i][j];
}
if(b[i] == 0) qu.push(i);
}
while(!qu.empty())
{
int t = qu.front();
qu.pop();
for(int i = 0; i < n; i++)
{
if(vv[i] && i != t && v[t][i]) vv[i] = false, Bridge(min(i, t), max(i, t));
}
for(int i = 0; i < n; i++)
{
if(i == t) continue;
if(v[i][t])
{
b[i]--;
if(b[i] == 0) qu.push(i);
}
}
}
// for(int i = 0; i < n; i++)
// {
// for(int j = i + 1; j < n; j++)
// {
// bool vv = false;
// for(int k = 0; k < n; k++)
// {
// if(i == k || j == k) continue;
// int t = Query(i, j, k);
// if(t != i && t != j) {vv = true;break;}
// }
// if(!vv) Bridge(i, j);
// }
// }
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
380 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
248 KB |
Output is correct |
| 8 |
Correct |
4 ms |
248 KB |
Output is correct |
| 9 |
Correct |
4 ms |
248 KB |
Output is correct |
| 10 |
Correct |
5 ms |
248 KB |
Output is correct |
| 11 |
Correct |
5 ms |
248 KB |
Output is correct |
| 12 |
Correct |
5 ms |
248 KB |
Output is correct |
| 13 |
Correct |
5 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
380 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
248 KB |
Output is correct |
| 8 |
Correct |
4 ms |
248 KB |
Output is correct |
| 9 |
Correct |
4 ms |
248 KB |
Output is correct |
| 10 |
Correct |
5 ms |
248 KB |
Output is correct |
| 11 |
Correct |
5 ms |
248 KB |
Output is correct |
| 12 |
Correct |
5 ms |
248 KB |
Output is correct |
| 13 |
Correct |
5 ms |
376 KB |
Output is correct |
| 14 |
Correct |
7 ms |
376 KB |
Output is correct |
| 15 |
Correct |
5 ms |
504 KB |
Output is correct |
| 16 |
Correct |
6 ms |
504 KB |
Output is correct |
| 17 |
Correct |
5 ms |
508 KB |
Output is correct |
| 18 |
Correct |
5 ms |
376 KB |
Output is correct |
| 19 |
Correct |
5 ms |
376 KB |
Output is correct |
| 20 |
Correct |
6 ms |
504 KB |
Output is correct |
| 21 |
Correct |
5 ms |
376 KB |
Output is correct |
| 22 |
Correct |
5 ms |
376 KB |
Output is correct |
| 23 |
Correct |
5 ms |
376 KB |
Output is correct |
| 24 |
Correct |
6 ms |
376 KB |
Output is correct |
| 25 |
Correct |
6 ms |
376 KB |
Output is correct |
| 26 |
Correct |
6 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
380 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
248 KB |
Output is correct |
| 8 |
Correct |
4 ms |
248 KB |
Output is correct |
| 9 |
Correct |
4 ms |
248 KB |
Output is correct |
| 10 |
Correct |
5 ms |
248 KB |
Output is correct |
| 11 |
Correct |
5 ms |
248 KB |
Output is correct |
| 12 |
Correct |
5 ms |
248 KB |
Output is correct |
| 13 |
Correct |
5 ms |
376 KB |
Output is correct |
| 14 |
Correct |
7 ms |
376 KB |
Output is correct |
| 15 |
Correct |
5 ms |
504 KB |
Output is correct |
| 16 |
Correct |
6 ms |
504 KB |
Output is correct |
| 17 |
Correct |
5 ms |
508 KB |
Output is correct |
| 18 |
Correct |
5 ms |
376 KB |
Output is correct |
| 19 |
Correct |
5 ms |
376 KB |
Output is correct |
| 20 |
Correct |
6 ms |
504 KB |
Output is correct |
| 21 |
Correct |
5 ms |
376 KB |
Output is correct |
| 22 |
Correct |
5 ms |
376 KB |
Output is correct |
| 23 |
Correct |
5 ms |
376 KB |
Output is correct |
| 24 |
Correct |
6 ms |
376 KB |
Output is correct |
| 25 |
Correct |
6 ms |
376 KB |
Output is correct |
| 26 |
Correct |
6 ms |
376 KB |
Output is correct |
| 27 |
Correct |
153 ms |
740 KB |
Output is correct |
| 28 |
Correct |
153 ms |
760 KB |
Output is correct |
| 29 |
Correct |
164 ms |
760 KB |
Output is correct |
| 30 |
Correct |
153 ms |
892 KB |
Output is correct |
| 31 |
Correct |
164 ms |
1016 KB |
Output is correct |
| 32 |
Correct |
166 ms |
764 KB |
Output is correct |
| 33 |
Correct |
153 ms |
888 KB |
Output is correct |
| 34 |
Correct |
146 ms |
760 KB |
Output is correct |
| 35 |
Correct |
141 ms |
764 KB |
Output is correct |
| 36 |
Correct |
149 ms |
760 KB |
Output is correct |
| 37 |
Correct |
230 ms |
888 KB |
Output is correct |
| 38 |
Correct |
238 ms |
760 KB |
Output is correct |
| 39 |
Correct |
203 ms |
760 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
17 ms |
1528 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
