oj.uz

Submission #63632

# Submission time Handle Problem Language Result Execution time Memory
63632 2018-08-02T09:49:03 Z radoslav11 The Big Prize (IOI17_prize) C++14
20 / 100
 117 ms 31392 KB 
#include <bits/stdc++.h>
#include "prize.h"
//#include "Lgrader.cpp"
 
using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);
 
vector<int> memo[MAXN];
int Q = 0;
bool stop;
bool dummy[MAXN];
 
vector<int> query(int i) 
{
	if(!memo[i].empty()) return memo[i];
	if(stop || dummy[i]||Q==5000) return vector<int>(2, 1e9);
 
	memo[i] = ask(i), Q++;
	if(Q == 10000) assert(false);
	return memo[i];
}
 
int n;
mt19937 mt(42);
 int cnt(int l, int r);
bool useless(int l, int r)
{
	if(cnt(l,r) == 0) return true;
	//if(query(r)[0] - query(l)[0] == 0) return true;
	return false;
}
int sum(int x) { return query(x)[0]+query(x)[1];}
 int better(int l, int r)
   {
       return sum(l)>sum(r);
   }
 
int cnt(int l, int r) { return query(l)[1] - query(r)[1] - better(l,r); }
 
void rec(int l, int r)
{
	if(r < l) return;
 
	int mid = (l + r) >> 1;
	if(query(l - 1)[0] + query(l - 1)[1] == 0) stop = 1;	
	
	if(query(r + 1)[0] + query(r + 1)[1] == 0) stop = 1;
 
	if(useless(l - 1, r + 1))
	{
		for(int i = l; i <= r; i++)
			memo[i] = query(l - 1);
		return;
	}
  /*
    if(cnt() && )
      {
      for(int i = l; i< mid;i++)dummy[i] = 1;
      for(int i = mid+1; i< r+1;i++)dummy[i] = 1;           return;
      }
   */
   	
    if(cnt(l - 1, mid) > cnt(mid, r + 1))
	{
		if(useless(l - 1, mid))
			for(int i = l; i < mid; i++)
				dummy[i] = 1;
		else
			rec(l, mid - 1);
 
		if(useless(mid, r + 1))
			for(int i = mid + 1; i <= r; i++)
				dummy[i] = 1;
		else
			rec(mid + 1, r);	
	}
	else
	{
		if(useless(mid, r + 1))
			for(int i = mid + 1; i <= r; i++)
				dummy[i] = 1;
		else
			rec(mid + 1, r);	
		
		if(useless(l - 1, mid))
			for(int i = l; i < mid; i++)
				dummy[i] = 1;
		else
			rec(l, mid - 1);
 
 
	}
}
 
int find_best(int n) 
{	
	::n = n;
	rec(1, n - 2);
	for(int i = 0; i < n; i++)
		if(query(i)[0] + query(i)[1] == 0)
			return i;
 
	return -1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 25080 KB Output is correct
2 Correct 44 ms 25188 KB Output is correct
3 Correct 40 ms 25216 KB Output is correct
4 Correct 65 ms 31272 KB Output is correct
5 Correct 34 ms 31272 KB Output is correct
6 Correct 29 ms 31272 KB Output is correct
7 Correct 37 ms 31272 KB Output is correct
8 Correct 37 ms 31272 KB Output is correct
9 Correct 35 ms 31272 KB Output is correct
10 Correct 48 ms 31272 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 31272 KB Output is correct
2 Correct 37 ms 31272 KB Output is correct
3 Correct 38 ms 31272 KB Output is correct
4 Correct 68 ms 31392 KB Output is correct
5 Correct 42 ms 31392 KB Output is correct
6 Correct 26 ms 31392 KB Output is correct
7 Correct 37 ms 31392 KB Output is correct
8 Correct 44 ms 31392 KB Output is correct
9 Correct 36 ms 31392 KB Output is correct
10 Correct 44 ms 31392 KB Output is correct
11 Correct 38 ms 31392 KB Output is correct
12 Correct 34 ms 31392 KB Output is correct
13 Correct 54 ms 31392 KB Output is correct
14 Correct 34 ms 31392 KB Output is correct
15 Correct 41 ms 31392 KB Output is correct
16 Correct 62 ms 31392 KB Output is correct
17 Incorrect 117 ms 31392 KB Integer -1 violates the range [0, 199999]
18 Halted 0 ms 0 KB -