Submission #928531

#	Time	Username	Problem	Language	Result	Execution time	Memory
928531		pan	Handcrafted Gift (IOI20_gift)	C++17	100 / 100	1042 ms	60940 KiB

gift

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define auto set<pi>:: iterator 
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
#include <vector>
#include <string>

set<pi> ranges;
vector<pi> condition;
ll const INF = 1e13;
void merge(ll l, ll r)
{
	auto lower = --ranges.ub(mp(l, INF));
	auto upper = --ranges.ub(mp(r, INF));
	l = lower->f; r = upper->s;
	while (lower!=upper) lower = ranges.erase(lower);
	ranges.erase(lower);
	ranges.insert(mp(l, r));
}
void craft(std::string &s);
int construct(int n, int r, std::vector<int> a, std::vector<int> b,  std::vector<int> x)
{
	ranges.clear();
	condition.resize(0);
	for (ll i=0; i<n; ++i) ranges.insert(mp(i,i));
	for (ll i=0; i<r; ++i)
	{
		if (x[i]==1) merge(a[i], b[i]);
		else condition.pb(mp(a[i], b[i]));
	}
	for (ll i=0; i<condition.size(); ++i)
	{
		ll l  = condition[i].f, r = condition[i].s;
		auto lower  = --ranges.ub(mp(l, INF));
		auto upper = --ranges.ub(mp(r, INF));
		if (lower==upper) return 0;
	}
	string ret = "";
	string arr[2] = {"R", "B"};
	ll cycle = 0;
	for (auto it = ranges.begin(); it!=ranges.end(); ++it)
	{
		for (ll u = 0; u<it->s-it->f+1; ++u) ret+=arr[cycle];
		cycle = (1-cycle)%2;
	}
	craft(ret);
	return 1;
}

Compilation message (stderr)

gift.cpp: In function 'int construct(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
gift.cpp:57:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for (ll i=0; i<condition.size(); ++i)
      |               ~^~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 30 / 30