# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901298 | LittleFlowers__ | Meetings (JOI19_meetings) | C++17 | 887 ms | 1128 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
struct Runner {
static const int N = 2e3 + 10;
bool dd[N];
int sz[N];
vector<int> adj[N];
int n;
void add_edge (int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
void del_edge (int u, int v) {
for(int i = 0; i < adj[u].size(); i++) if (adj[u][i] == v) {
adj[u].erase(adj[u].begin() + i);
}
for(int i = 0; i < adj[v].size(); i++) if (adj[v][i] == u) {
adj[v].erase(adj[v].begin() + i);
}
}
int calc (int u, int p) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |