# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
791772 | ezzzay | Split the Attractions (IOI19_split) | C++14 | 87 ms | 66872 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 <cstdio>
#include <cassert>
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
vector<int>v[N];
bool vis[N];
vector<int>ans;
void dfs(int a){
vis[a]=1;
ans.push_back(a);
for(auto b:v[a]){
if(vis[b]==0)dfs(b);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<pair<int,int>>f;
f.push_back({a,1});f.push_back({b,2});f.push_back({c,3});
sort(f.begin(),f.end());
for(int i=0;i<p.size();i++){
v[p[i]].push_back(q[i]);
v[q[i]].push_back(p[i]);
}
vector<int> res;
dfs(0);
int arr[N];
while(a--){
arr[ans[ans.size()-1]]=1;
ans.pop_back();
}
while(b--){
arr[ans[ans.size()-1]]=2;
ans.pop_back();
}
while(c--){
arr[ans[ans.size()-1]]=3;
ans.pop_back();
}
for(int i=0;i<n;i++){
res.push_back(arr[i]);
}
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... |