oj.uz

Submission #251523

# Submission time Handle Problem Language Result Execution time Memory
251523 2020-07-21T16:56:42 Z kostia244 Jousting tournament (IOI12_tournament) C++17
100 / 100
 225 ms 23544 KB 
#include<bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
struct range {
	int i, l, r;
	bool operator<(const range &rhs) const {
		return l < rhs.l;
	}
};
using oset = tree<range, null_type, less<range>, rb_tree_tag, tree_order_statistics_node_update>;
const int maxn = 1<<18;
int n, c, x, l[maxn], r[maxn];
vector<int> g[maxn];

int tr[maxn];
int qry(int l, int r) {
	int ans = 0;
	for(l += n, r += n; l < r; l>>=1, r>>=1) {
		if(l&1) ans = max(ans, tr[l++]);
		if(r&1) ans = max(ans, tr[--r]);
	}
	return ans;
}

array<int, 2> dfs(int v) {
	if(v < n) return {0, -v};
	int good = qry(l[v], r[v]) < x;
	array<int, 2> cur = {-1, 1<<30};
	for(auto &i : g[v]) cur = max(cur, dfs(i));
	cur[0] += good;
	return cur;
}
int GetBestPosition(int N, int C, int X, int *a, int *s, int *e) {
	n = N, c = C, x = X;
	for(int i = 0; i < n-1; i++) {
		int j = n+i;
		for(;j;j>>=1) tr[j] = max(tr[j], a[i]);
	}
	oset b;
	for(int i = 0; i < n; i++) l[i] = r[i] = i, b.insert(range{i, l[i], r[i]});
	for(int i = 0; i < c; i++) {
		int len = e[i] - s[i] + 1;
		int nl, nr;
		for(int j = 1; j <= len; j++) {
			auto t = *b.find_by_order(s[i]);
			if(j == 1) nl = t.l;
			if(j == len) nr = t.r;
			g[n+i].push_back(t.i);
			b.erase(t);
		}
		l[n+i] = nl;
		r[n+i] = nr;
		b.insert(range{n+i, nl, nr});
		//for(auto i : b) cout << i.l << " " << i.r << " | "; cout << '\n';
	}
	return -dfs(n+c-1)[1];
}

Compilation message

tournament.cpp: In function 'int GetBestPosition(int, int, int, int*, int*, int*)':
tournament.cpp:43:11: warning: 'nr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int nl, nr;
           ^~
tournament.cpp:43:7: warning: 'nl' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int nl, nr;
       ^~

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6528 KB Output is correct
2 Correct 11 ms 7416 KB Output is correct
3 Correct 8 ms 6912 KB Output is correct
4 Correct 10 ms 7168 KB Output is correct
5 Correct 10 ms 7168 KB Output is correct
6 Correct 11 ms 7040 KB Output is correct
7 Correct 13 ms 7424 KB Output is correct
8 Correct 10 ms 7168 KB Output is correct
9 Correct 7 ms 6912 KB Output is correct
10 Correct 13 ms 7168 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 11152 KB Output is correct
2 Correct 225 ms 23544 KB Output is correct
3 Correct 118 ms 15480 KB Output is correct
4 Correct 210 ms 20088 KB Output is correct
5 Correct 204 ms 20984 KB Output is correct
6 Correct 207 ms 16892 KB Output is correct
7 Correct 218 ms 21240 KB Output is correct
8 Correct 220 ms 21240 KB Output is correct
9 Correct 101 ms 15224 KB Output is correct
10 Correct 132 ms 15480 KB Output is correct