oj.uz

Submission #815740

# Submission time Handle Problem Language Result Execution time Memory
815740 2023-08-08T20:22:13 Z denniskim Handcrafted Gift (IOI20_gift) C++17
100 / 100
 169 ms 26684 KB 
#include "gift.h"
#include <bits/stdc++.h>

using namespace std;
typedef int ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll arr[5000010];
ll num[5000010];
string ans;
vector<pll> vec;

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x)
{
	for(ll i = 0 ; i < r ; i++)
	{
		if(x[i] == 1)
			vec.push_back({a[i], b[i]});
	}
	
	ll cc = 1, cc2 = 1;
	ll gapa = 0;
	
	if(!vec.empty())
	{
		sort(vec.begin(), vec.end());
		
		ll S = vec[0].fi;
		ll E = vec[0].se;
		
		for(auto &i : vec)
		{
			if(!gapa)
			{
				gapa = 1;
				continue;
			}
			
			if(E < i.fi)
			{
				for(ll j = S ; j <= E ; j++)
					arr[j] = cc;
				
				cc++;
				S = i.fi, E = i.se;
			}
			
			else
				E = max(E, i.se);
		}
		
		for(ll j = S ; j <= E ; j++)
			arr[j] = cc;
		
		cc++;
	}
	
	for(ll i = 0 ; i < n ; i++)
	{
		if(!arr[i])
			arr[i] = cc++;
	}
	
	for(ll i = 0 ; i < n ; i++)
	{
		if(!num[arr[i]])
			num[arr[i]] = cc2++;
	}
	
	for(ll i = 0 ; i < r ; i++)
	{
		if(x[i] == 2)
		{
			if(num[arr[b[i]]] - num[arr[a[i]]] == 0)
				return 0;
		}
	}
	
	char now = 'R';
	
	ans.push_back('R');
	
	for(ll i = 1 ; i < n ; i++)
	{
		if(arr[i] != arr[i - 1])
			now = 'B' + 'R' - now;
		
		ans.push_back(now);
	}
	
	craft(ans);
	return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 159 ms 21220 KB Output is correct
6 Correct 169 ms 21256 KB Output is correct
7 Correct 151 ms 20076 KB Output is correct
8 Correct 164 ms 20072 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 111 ms 16984 KB Output is correct
5 Correct 110 ms 16996 KB Output is correct
6 Correct 104 ms 15912 KB Output is correct
7 Correct 103 ms 15900 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 159 ms 21220 KB Output is correct
6 Correct 169 ms 21256 KB Output is correct
7 Correct 151 ms 20076 KB Output is correct
8 Correct 164 ms 20072 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 111 ms 16984 KB Output is correct
13 Correct 110 ms 16996 KB Output is correct
14 Correct 104 ms 15912 KB Output is correct
15 Correct 103 ms 15900 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 5 ms 5644 KB Output is correct
36 Correct 6 ms 5912 KB Output is correct
37 Correct 10 ms 6340 KB Output is correct
38 Correct 133 ms 26684 KB Output is correct
39 Correct 128 ms 24972 KB Output is correct
40 Correct 136 ms 26260 KB Output is correct
41 Correct 135 ms 26256 KB Output is correct
42 Correct 135 ms 26428 KB Output is correct