# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832204 | tranxuanbach | Split the Attractions (IOI19_split) | C++17 | 61 ms | 11280 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 "split.h"
#include <bits/stdc++.h>
using namespace std;
#define isz(a) ((signed)a.size())
const int N = 1e5 + 5, M = 2e5 + 5;
int n, m;
int a, b, c;
vector <int> adj[N];
vector <int> ans;
namespace subtask12{
bool check(){
if (a == 1){
return true;
}
for (int u = 0; u < n; u++){
if (isz(adj[u]) > 2){
return false;
}
}
return true;
}
vector <bool> chosen;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |