Submission #63629

#	Time	Username	Problem	Language	Result	Execution time	Memory
63629		radoslav11	커다란 상품 (IOI17_prize)	C++14	Compilation error	0 ms	0 KiB

prize

#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]) return vector<int>(2, 1e9);
 
	memo[i] = ask(i), Q++;
	if(Q == 10000) assert(false);
	return memo[i];
}
 
int n;
mt19937 mt(42);
 
bool useless(int l, int r)
{
	if(query(l)[1] - query(r)[1] == 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;
}

Compilation message (stderr)

prize.cpp:36:2: error: stray '\302' in program
    {
  ^
prize.cpp:36:3: error: stray '\240' in program
    {
   ^
prize.cpp:37:2: error: stray '\302' in program
        return sum(l)>sum(r);
  ^
prize.cpp:37:3: error: stray '\240' in program
        return sum(l)>sum(r);
   ^
prize.cpp:37:5: error: stray '\302' in program
        return sum(l)>sum(r);
     ^
prize.cpp:37:6: error: stray '\240' in program
        return sum(l)>sum(r);
      ^
prize.cpp:37:8: error: stray '\302' in program
        return sum(l)>sum(r);
        ^
prize.cpp:37:9: error: stray '\240' in program
        return sum(l)>sum(r);
         ^
prize.cpp:38:2: error: stray '\302' in program
    }
  ^
prize.cpp:38:3: error: stray '\240' in program
    }
   ^
prize.cpp:57:2: error: stray '\302' in program
   /*
  ^
prize.cpp:57:3: error: stray '\240' in program
   /*
   ^
prize.cpp:64:2: error: stray '\302' in program
     
  ^
prize.cpp:64:3: error: stray '\240' in program
     
   ^