oj.uz

Submission #105774

# Submission time Handle Problem Language Result Execution time Memory
105774 2019-04-14T14:31:22 Z RezwanArefin01 Jousting tournament (IOI12_tournament) C++17
100 / 100
 214 ms 11028 KB 
#include <bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
using namespace std; 

typedef pair<int, int> ii; 
typedef tree<
ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int M = 2e5 + 10; 

struct node {
	int sum, flag, l, d; 
	node(int s=0, int f=0, int l=0, int d=0) :
		sum(s), flag(f), l(l), d(d) {} 
} t[M];

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
	ordered_set st; int idx = N; 

	for(int i = 0; i < N - 1; i++) { 
		t[i] = node(K[i] > R, K[i] > R, i, 0); 
		st.insert({i, i}); 
	}

	t[N - 1] = node(0, 0, N - 1, 0);
	st.insert({N - 1, N - 1});
	
	for(int i = 0; i < C; ++i, ++idx) {
		auto s = st.find_by_order(S[i]);  
		auto e = st.find_by_order(E[i]); 
		t[idx].flag = t[e -> second].flag; 
			
		++e; 
		while(s != e) {
			int id = s -> second; 
			t[idx].sum += t[id].sum; 

			if(t[id].d + 1 > t[idx].d) {
				t[idx].d = t[id].d + 1;
				t[idx].l = t[id].l; 
			} 

			auto it = s; s++; 
			st.erase(it);
		}

		st.insert({t[idx].l, idx});
	}	

	int maxwin = 0, ans = 0;

	for(int i = 0; i < idx; i++) if(t[i].d >= maxwin){
		if(t[i].sum == 0 || (t[i].sum == 1 && t[i].flag)) {
			if(t[i].d > maxwin) {
				maxwin = t[i].d;
				ans = t[i].l; 
			} else {
				ans = min(ans, t[i].l);
			}
		}
	}

	return ans; 
}

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3492 KB Output is correct
2 Correct 13 ms 3840 KB Output is correct
3 Correct 7 ms 3712 KB Output is correct
4 Correct 10 ms 3840 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 11 ms 3840 KB Output is correct
7 Correct 10 ms 3840 KB Output is correct
8 Correct 14 ms 3840 KB Output is correct
9 Correct 8 ms 3840 KB Output is correct
10 Correct 11 ms 3840 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 7104 KB Output is correct
2 Correct 214 ms 10912 KB Output is correct
3 Correct 123 ms 10212 KB Output is correct
4 Correct 189 ms 10872 KB Output is correct
5 Correct 176 ms 10616 KB Output is correct
6 Correct 200 ms 10616 KB Output is correct
7 Correct 178 ms 10992 KB Output is correct
8 Correct 188 ms 11028 KB Output is correct
9 Correct 91 ms 10104 KB Output is correct
10 Correct 127 ms 10104 KB Output is correct