oj.uz

Submission #146145

# Submission time Handle Problem Language Result Execution time Memory
146145 2019-08-22T11:17:02 Z MvC Worm Worries (BOI18_worm) C++11
10 / 100
 2 ms 424 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e6+50;
const int mod=1e9+7;
using namespace std;
int n,m,k,q,viz[nmax];
int ask(int x)
{
	if(x==0 || x==n+1)return 0;
	if(viz[x])return viz[x];
	cout<<"? "<<x<<" "<<1<<" "<<1<<endl;
	cin>>viz[x];
	return viz[x];
}
void ans(int x,int y,int z)
{
	cout<<"! "<<x<<" "<<y<<" "<<z<<endl;
	exit(0);
}
void rec(int l,int r)
{
	srand(time(0));
	if(l==r)ans(l,1,1);
	int mid=(l+r)/2;
	int x=ask(mid),y=ask(mid+1);
	//if(max(x,z)<=y)ans(mid,1,1);
	if(x>y)
	{
		rec(l,mid);
	}
	else if(x<y)
	{
		rec(mid+1,r);
	}
	else
	{
		if(rand()&1)rec(l,mid);
		else rec(mid+1,r);
	}
	/*else if(x<=y && y<z)
	{
		rec(mid+1,r);
	}
	else if(x>y && y<z)
	{
		if(rand()&1)rec(l,mid-1);
		else rec(mid+1,r);
	}*/
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m>>k>>q;
	rec(1,n);
	return 0;
}

Compilation message

worm.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
worm.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 424 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB too many queries. input: ? 499998 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 376 KB not a local maximu
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Incorrect 2 ms 248 KB not a local maximu
5 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 376 KB not a local maximu
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 248 KB not a local maximu
3 Halted 0 ms 0 KB -