oj.uz

Submission #223237

# Submission time Handle Problem Language Result Execution time Memory
223237 2020-04-15T05:55:09 Z shenxy Klasika (COCI20_klasika) C++11
0 / 110
 59 ms 3192 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cassert>
using namespace std;
struct seg {
	int s, e, m;
	set<int> v;
	seg *l, *r;
	seg(int _s, int _e) {
		s = _s, e = _e, m = (s + e) / 2;
		l = r = NULL;
	}
	void update(int i, int nv) {
		if (s != e) {
			if (i > m) {
				if (r == NULL) r = new seg(m + 1, e);
				r -> update(i, nv);
			} else {
				if (l == NULL) l = new seg(s, m);
				l -> update(i, nv);
			}
			v.insert(nv);
		} else v.insert(nv);
	}
	int query(int a, int b, int x) {
		if (x & (e - s + 1)) return 0;
		return 5;
	}
} *root = new seg(0, 1 << 31);
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int Q, a, b;
	string op;
	cin >> Q;
	for (int i = 0; i < Q; ++i) {
		cin >> op >> a >> b;
		assert(b < (1 << 30));
	}
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 3192 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -