oj.uz

Submission #309110

# Submission time Handle Problem Language Result Execution time Memory
309110 2020-10-02T18:33:19 Z cheetose Handcrafted Gift (IOI20_gift) C++17
100 / 100
 203 ms 16176 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "gift.h"
int parent[500000];
int find(int a)
{
	if (parent[a] < 0)return a;
	return parent[a] = find(parent[a]);
}
void merge(int a, int b)
{
	a = find(a), b = find(b);
	if (a != b)
	{
		parent[a] = b;
	}
}
int construct(int n, int r, Vi a, Vi b, Vi x){
	MEM_1(parent);
	fup(i,0,r-1,1){
		if(x[i]==2)continue;
		int x=find(a[i]),y=find(b[i]);
		while(x!=y){
			merge(x,x+1);
			x=find(x);
		}
	}
	fup(i,0,r-1,1){
		if(x[i]==2){
			if(find(a[i])==find(b[i]))return 0;
		}
	}
	string s;
	int t=0;
	fup(i,0,n-1,1){
		s+=t?'B':'R';
		if(parent[i]<0)t^=1;
	}
	craft(s);
	return 1;
}
/*
int main() {
}*/

Compilation message

gift.cpp: In function 'int construct(int, int, Vi, Vi, Vi)':
gift.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
gift.cpp:59:2: note: in expansion of macro 'fup'
   59 |  fup(i,0,r-1,1){
      |  ^~~
gift.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
gift.cpp:67:2: note: in expansion of macro 'fup'
   67 |  fup(i,0,r-1,1){
      |  ^~~
gift.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
gift.cpp:74:2: note: in expansion of macro 'fup'
   74 |  fup(i,0,n-1,1){
      |  ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 1 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 5 ms 2560 KB Output is correct
5 Correct 180 ms 15280 KB Output is correct
6 Correct 178 ms 15252 KB Output is correct
7 Correct 203 ms 16176 KB Output is correct
8 Correct 198 ms 16176 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 5 ms 2560 KB Output is correct
4 Correct 186 ms 15152 KB Output is correct
5 Correct 185 ms 15152 KB Output is correct
6 Correct 175 ms 14072 KB Output is correct
7 Correct 176 ms 14072 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 1 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 1 ms 2304 KB Output is correct
7 Correct 2 ms 2304 KB Output is correct
8 Correct 2 ms 2304 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 1 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 2 ms 2304 KB Output is correct
7 Correct 2 ms 2304 KB Output is correct
8 Correct 2 ms 2304 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 2 ms 2304 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 1 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 5 ms 2560 KB Output is correct
5 Correct 180 ms 15280 KB Output is correct
6 Correct 178 ms 15252 KB Output is correct
7 Correct 203 ms 16176 KB Output is correct
8 Correct 198 ms 16176 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 2 ms 2304 KB Output is correct
11 Correct 5 ms 2560 KB Output is correct
12 Correct 186 ms 15152 KB Output is correct
13 Correct 185 ms 15152 KB Output is correct
14 Correct 175 ms 14072 KB Output is correct
15 Correct 176 ms 14072 KB Output is correct
16 Correct 2 ms 2304 KB Output is correct
17 Correct 1 ms 2304 KB Output is correct
18 Correct 2 ms 2304 KB Output is correct
19 Correct 2 ms 2304 KB Output is correct
20 Correct 2 ms 2304 KB Output is correct
21 Correct 1 ms 2304 KB Output is correct
22 Correct 2 ms 2304 KB Output is correct
23 Correct 2 ms 2304 KB Output is correct
24 Correct 2 ms 2304 KB Output is correct
25 Correct 2 ms 2304 KB Output is correct
26 Correct 2 ms 2304 KB Output is correct
27 Correct 2 ms 2304 KB Output is correct
28 Correct 1 ms 2304 KB Output is correct
29 Correct 2 ms 2304 KB Output is correct
30 Correct 2 ms 2304 KB Output is correct
31 Correct 2 ms 2304 KB Output is correct
32 Correct 2 ms 2304 KB Output is correct
33 Correct 2 ms 2304 KB Output is correct
34 Correct 2 ms 2304 KB Output is correct
35 Correct 8 ms 3664 KB Output is correct
36 Correct 8 ms 3664 KB Output is correct
37 Correct 16 ms 4560 KB Output is correct
38 Correct 193 ms 15280 KB Output is correct
39 Correct 188 ms 14072 KB Output is correct
40 Correct 201 ms 15152 KB Output is correct
41 Correct 200 ms 15152 KB Output is correct
42 Correct 194 ms 15536 KB Output is correct