| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 342128 | AmineWeslati | Split the Attractions (IOI19_split) | C++14 | 0 ms | 0 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.
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#ifndef LOCAL
#include "split.h"
#endif
int N,A,B,C;
vi adj[MX];
vi res;
int nb;
void dfs(int u){
for(auto v: adj[u]) if(res[v]==-1 && nb<B){
res[v]=2;
nb++;
dfs(v);
}
}
bool sub1(){
FOR(i,0,N) if(sz(adj[i])>2) return false;
return true;
}
vi find_split(int n, int a, int b, int c, vi p, vi q) {
N=n; A=a; B=b; C=c;
FOR(i,0,sz(p)){
int u=p[i],v=q[i];
adj[u].pb(v);
adj[v].pb(u);
}
if(sub1()){
int u=0,p=-1;
FOR(i,0,N) if(sz(adj[i])==1){u=i; break;}
vi vec;
while(sz(vec)<N){
vec.pb(u);
int nxt=-1;
for(auto v: adj[u]) if(v!=p) nxt=v;
p=u; u=nxt;
}
vi res(N,3);
FOR(i,0,a) res[vec[i]]=1;
FOR(i,a,a+b) res[vec[i]]=2;
return res;
}
else if(a==1){
res.assign(N,-1);
res[0]=2; nb=1;
dfs(0);
FOR(i,0,N) if(res[i]==-1){res[i]=1; break;}
FOR(i,0,N) if(res[i]==-1) res[i]=3;
return res;
}
return{};
}
int main() {
boost; IO();
int N,M,a,b,c; cin>>N>>M>>a>>b>>c;
vi p(M),q(M);
FOR(i,0,M) cin>>p[i]>>q[i];
vi v=find_split(N,a,b,c,p,q);
dbgv(v);
return 0;
}
/*
a=1
5 6 1 2 2
0 1
1 2
2 3
3 0
0 2
2 4
*/
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Multisets are shit
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/