Submission #742547

#	Time	Username	Problem	Language	Result	Execution time	Memory
742547		myrcella	Split the Attractions (IOI19_split)	C++17	0 / 100	46 ms	11276 KiB

split

//by szh
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
 
#include "split.h"
 
const int maxn = 2e5+10;
int deg[maxn];
vector <int> edge[maxn];
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	rep(i,0,SZ(p)) edge[p[i]].pb(q[i]),edge[q[i]].pb(p[i]);
	int start;
	rep(i,0,n) if (SZ(edge[i])==1) start=i;
	int lst = -1;
	vector <int> res(n);
	rep(i,0,n) {
      assert(start>=0 and start<n);
		if (i<a) res[start]=1;
		else if (i<a+b) res[start]=2;
		else res[start]=3;
		if (i==n-1) break;
		if (edge[start][0]==lst) lst = start,start = edge[start][1];
		else lst=start, start=edge[start][0];
	}
	return res;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36