# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990556 | alexdd | Mađioničar (COI22_madionicar) | C++17 | 5087 ms | 1592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n,cntq;
string s;
bool verif(int le, int ri)
{
for(int i=0;i<=ri-le;i++)
if(s[le+i]!=s[ri-i])
return 0;
return 1;
}
int p[100005];
bool query(int le, int ri)
{
if(le<1 || ri>n || le>ri)
return 0;
if(le==ri)
return 1;
cntq++;
//return verif(le,ri);
if(cntq>200000)
{
while(1);
}
int aux;
cout<<"? "<<le<<" "<<ri<<endl;
cin>>aux;
return aux;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |