# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021276 | vjudge1 | Split the Attractions (IOI19_split) | C++17 | 54 ms | 15360 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>
#define ll long long
#define mid ((l+r)>>1)
#define pii pair<int,int>
#define fi first
#define se second
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repr(a,b,c) for(int a=b-1; a>c-1; a--)
#define pb push_back
#define repa(a,b) for(auto a:b)
using namespace std;
const int lim=2e5+5;
vector<int> adj[lim];
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<int> res(n,0), res2(n,0);
queue<int> Q;
rep(i,0,p.size()){
adj[p[i]].pb(q[i]);
adj[q[i]].pb(p[i]);
}
int d[3]={a,b,c}, u;
bool vis[n]{};
repr(j,3,0){
rep(i,0,n){
if(!vis[i]){
Q.push(i);
while(Q.size()){
u=Q.front();
Q.pop();
if(vis[u]) continue;
vis[u]=true;
res[u]=j+1;
d[j]--;
if(!d[j]) break;
repa(v,adj[u]) if(!vis[v]) Q.push(v);
}
while(Q.size()) Q.pop();
}
if(!d[j]) break;
}
}
return res;
}
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... |