#include "meetings.h"
#include <bits/stdc++.h>
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e3 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
using namespace std;
int res[N][N], cnt[N];
vi g[N];
int ask (int x, int y) {
if (x > y)
swap(x, y);
if (res[x][y] != -1)
return res[x][y];
return res[x][y] = Query(0, x, y);
}
bool cmp (int x, int y) {
return cnt[x] > cnt[y];
}
bool bad[N];
void Solve(int n) {
memset(res, -1, sizeof(res));
forn (i, 1, n - 1) {
forn (j, 1, n - 1)
if (i != j && ask(i, j) == i) {
g[j].pb(i);
++cnt[i];
}
g[i].pb(0);
++cnt[0];
}
forn (i, 1, n - 1) {
int j = g[i][0];
for (auto x : g[i])
if (cnt[x] < cnt[j])
j = x;
Bridge(min(i, j), max(i, j));
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 2 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 3 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 4 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 6 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 7 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 8 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 9 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 10 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 11 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 12 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 13 |
Correct |
13 ms |
16252 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 2 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 3 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 4 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 6 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 7 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 8 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 9 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 10 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 11 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 12 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 13 |
Correct |
13 ms |
16252 KB |
Output is correct |
| 14 |
Correct |
16 ms |
16248 KB |
Output is correct |
| 15 |
Correct |
14 ms |
16252 KB |
Output is correct |
| 16 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 17 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 18 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 19 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 20 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 21 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 22 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 23 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 24 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 25 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 26 |
Correct |
15 ms |
16248 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 2 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 3 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 4 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 6 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 7 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 8 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 9 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 10 |
Correct |
13 ms |
16120 KB |
Output is correct |
| 11 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 12 |
Correct |
13 ms |
16248 KB |
Output is correct |
| 13 |
Correct |
13 ms |
16252 KB |
Output is correct |
| 14 |
Correct |
16 ms |
16248 KB |
Output is correct |
| 15 |
Correct |
14 ms |
16252 KB |
Output is correct |
| 16 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 17 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 18 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 19 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 20 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 21 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 22 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 23 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 24 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 25 |
Correct |
14 ms |
16248 KB |
Output is correct |
| 26 |
Correct |
15 ms |
16248 KB |
Output is correct |
| 27 |
Correct |
163 ms |
16248 KB |
Output is correct |
| 28 |
Correct |
165 ms |
16248 KB |
Output is correct |
| 29 |
Correct |
160 ms |
16376 KB |
Output is correct |
| 30 |
Correct |
166 ms |
16248 KB |
Output is correct |
| 31 |
Correct |
169 ms |
16376 KB |
Output is correct |
| 32 |
Correct |
182 ms |
16248 KB |
Output is correct |
| 33 |
Correct |
166 ms |
16348 KB |
Output is correct |
| 34 |
Correct |
161 ms |
16300 KB |
Output is correct |
| 35 |
Correct |
165 ms |
16280 KB |
Output is correct |
| 36 |
Correct |
192 ms |
16280 KB |
Output is correct |
| 37 |
Correct |
248 ms |
16368 KB |
Output is correct |
| 38 |
Correct |
283 ms |
16428 KB |
Output is correct |
| 39 |
Correct |
267 ms |
16504 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3085 ms |
16412 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
