oj.uz

Submission #835582

# Submission time Handle Problem Language Result Execution time Memory
835582 2023-08-23T16:19:11 Z MadokaMagicaFan Teams (IOI15_teams) C++14
34 / 100
 4000 ms 26668 KB 
#include "bits/stdc++.h"
#include "teams.h"
using namespace std;

mt19937 rng(time(NULL));

int n;
vector<int> a, b;
vector<int> ord;

struct node {
	int l, r;
	int v;
	int w;
	int s;
} t[(int)5e5+5];

int size(int x) {
	if (x < 0) return 0;
	return t[x].s;
}

void upd(int x) {
	if (x < 0) return;
	t[x].s = 1 + size(t[x].l) + size(t[x].r);
}

int uni(int l, int r) {
	if (l < 0) return r;
	if (r < 0) return l;

	if (t[l].w > t[r].w) {
		t[l].r = uni(t[l].r, r);
		upd(l); return l;
	} else {
		t[r].l = uni(l, t[r].l);
		upd(r); return r;
	}
}

/* <= for left */
void splitv(int tp, int &l, int &r, int v) {
	if (tp == -1) {
		l = r = -1;
		return;
	}

	if (t[tp].v <= v) {
		l = tp;
		splitv(t[l].r, t[l].r, r, v);
		upd(l);
	} else {
		r = tp;
		splitv(t[r].l, l, t[r].l, v);
		upd(r);
	}
}

void splitk(int tp, int &l, int &r, int k) {
	if (tp == -1) {
		l = r = -1;
		return;
	}

	if (1 + size(t[tp].l) <= k) {
		l = tp;
		splitk(t[l].r, t[l].r, r, k - 1 - size(t[tp].l));
		upd(l);
	} else {
		r = tp;
		splitk(t[r].l, l, t[r].l, k);
		upd(r);
	}
}

int can(int m, int K[]) {
	vector<int> k(m);
	for (int i = 0; i < m; ++i)
		k[i] = K[i];
	sort(k.begin(), k.end());

	int p1 = 0;
	int p2 = 0;

	int x, y, z, head = -1;
	for (int i = 1; i<= n; ++i) {
		while (p1 < n && a[ord[p1]] <= i) {
			x = ord[p1]; ++p1;
			t[x].l = t[x].r = -1;
			t[x].w = rng() % ((int)1e6);
			t[x].v = b[x];
			upd(x);
			splitv(head, y, z, b[x]);
			head = uni(y, x);
			head = uni(head, z);
		}

		while (p2 < m && k[p2] <= i) {
			x = k[p2++];
			splitv(head, head, z, x-1);
			if (size(z) < x) return 0;
			splitk(z, y, z, x);
			head =uni(head, z);
		}
	}

	return 1;
}

void init(int N, int A[], int B[]) {
	n = N;
	a.assign(n,0);
	b.assign(n,0);
	ord.assign(n,0);
	for (int i = 0; i < n; ++i) {
		ord[i] = i;
		a[i] = A[i];
		b[i] = B[i];
	}

	sort(ord.begin(), ord.end(), [&](int i, int j) { return a[i] < a[j]; });
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:90:19: warning: conversion from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   90 |    t[x].w = rng() % ((int)1e6);
      |             ~~~~~~^~~~~~~~~~~~

Subtask #1
21.0 / 21.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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 260 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3412 KB Output is correct
2 Correct 13 ms 3452 KB Output is correct
3 Correct 75 ms 5380 KB Output is correct
4 Correct 15 ms 4404 KB Output is correct
5 Correct 18 ms 4948 KB Output is correct
6 Correct 27 ms 5008 KB Output is correct
7 Correct 9 ms 3068 KB Output is correct
8 Correct 11 ms 2972 KB Output is correct
9 Correct 27 ms 5280 KB Output is correct
10 Correct 25 ms 4780 KB Output is correct
11 Correct 20 ms 4812 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 34 ms 5180 KB Output is correct
14 Correct 40 ms 5200 KB Output is correct
15 Correct 67 ms 5356 KB Output is correct
16 Correct 14 ms 5316 KB Output is correct
17 Correct 33 ms 5240 KB Output is correct
18 Correct 35 ms 5272 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4140 KB Output is correct
2 Correct 19 ms 4360 KB Output is correct
3 Execution timed out 4029 ms 5628 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 18272 KB Output is correct
2 Correct 89 ms 18444 KB Output is correct
3 Execution timed out 4027 ms 26668 KB Time limit exceeded
4 Halted 0 ms 0 KB -