| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 131535 |
2019-07-17T08:54:30 Z |
Kewo |
Meetings (JOI19_meetings) |
C++17 |
|
25 ms |
1016 KB |
#include "meetings.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define spc " "
#define endl "\n"
#define fast_io() cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
using namespace std;
typedef pair<int, int> ii;
typedef long long int lli;
const int N = (55);
const int LOG = (20);
int adj[N][N], call;
vector<int> btw[N][N];
void Solve(int N) {
for(int i = 0; i < N; i++)
for(int j = i + 1; j < N; j++)
for(int k = j + 1; k < N; k++) {
int res = Query(i, j, k);
if(res == i) {
btw[j][k].pb(i);
btw[k][j].pb(i);
}
if(res == j) {
btw[i][k].pb(j);
btw[k][i].pb(j);
}
if(res == k) {
btw[i][j].pb(k);
btw[j][i].pb(k);
}
}
for(int i = 0; i < N; i++)
for(int j = i + 1; j < N; j++)
if(btw[i][j].size() == 1) {
int node = btw[i][j][0];
adj[i][node] = 1;
adj[node][i] = 1;
adj[j][node] = 1;
adj[node][j] = 1;
}
for(int i = 0; i < N; i++)
for(int j = i + 1; j < N; j++)
if(adj[i][j])
Bridge(i, j);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 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 |
504 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 |
504 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 |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 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 |
504 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 |
504 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
13 ms |
504 KB |
Output is correct |
| 15 |
Correct |
13 ms |
504 KB |
Output is correct |
| 16 |
Correct |
12 ms |
504 KB |
Output is correct |
| 17 |
Correct |
13 ms |
504 KB |
Output is correct |
| 18 |
Correct |
14 ms |
504 KB |
Output is correct |
| 19 |
Correct |
13 ms |
504 KB |
Output is correct |
| 20 |
Correct |
11 ms |
504 KB |
Output is correct |
| 21 |
Correct |
12 ms |
504 KB |
Output is correct |
| 22 |
Correct |
12 ms |
504 KB |
Output is correct |
| 23 |
Correct |
16 ms |
632 KB |
Output is correct |
| 24 |
Correct |
20 ms |
760 KB |
Output is correct |
| 25 |
Correct |
19 ms |
740 KB |
Output is correct |
| 26 |
Correct |
18 ms |
632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 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 |
504 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 |
504 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
13 ms |
504 KB |
Output is correct |
| 15 |
Correct |
13 ms |
504 KB |
Output is correct |
| 16 |
Correct |
12 ms |
504 KB |
Output is correct |
| 17 |
Correct |
13 ms |
504 KB |
Output is correct |
| 18 |
Correct |
14 ms |
504 KB |
Output is correct |
| 19 |
Correct |
13 ms |
504 KB |
Output is correct |
| 20 |
Correct |
11 ms |
504 KB |
Output is correct |
| 21 |
Correct |
12 ms |
504 KB |
Output is correct |
| 22 |
Correct |
12 ms |
504 KB |
Output is correct |
| 23 |
Correct |
16 ms |
632 KB |
Output is correct |
| 24 |
Correct |
20 ms |
760 KB |
Output is correct |
| 25 |
Correct |
19 ms |
740 KB |
Output is correct |
| 26 |
Correct |
18 ms |
632 KB |
Output is correct |
| 27 |
Runtime error |
4 ms |
760 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 28 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
25 ms |
1016 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
