# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
823963 |
2023-08-13T10:45:43 Z |
Kahou |
Meetings (JOI19_meetings) |
C++14 |
|
1623 ms |
1080 KB |
#include<bits/stdc++.h>
#include"meetings.h"
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2050;
int n, sub[MAXN];
bool mark[MAXN][MAXN];
void Solve(int N) {
n = N;
sub[0] = n-1;
for (int u = 1; u < n; u++) {
mark[0][u] = 1;
}
for (int u = 1; u < n; u++) {
for (int v = u+1; v < n; v++) {
int lca = Query(0, u, v);
if (lca == u) {
mark[u][v] = 1;
sub[u]++;
}
else if (lca == v) {
mark[v][u] = 1;
sub[v]++;
}
}
}
for (int u = 1; u < n; u++) {
int v = 0;
for (int w = 0; w < n; w++) {
if (mark[w][u] && sub[w] < sub[v]) v = w;
}
if (u > v) swap(u, v);
Bridge(u, v);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
336 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
336 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
336 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1623 ms |
1080 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |