QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#187360 | #4912. WereYouLast | Crysfly | 0 | 1ms | 5120kb | C++20 | 791b | 2023-09-24 16:37:41 | 2023-09-24 16:37:41 |
answer
// what is matter? never mind.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
#define maxn 500005
#define inf 0x3f3f3f3f
bool query(int);
void modify(int,bool);
bool WereYouLast(int n,int m){
if(n==(1<<10)){
int p=0;
while(p<10 && query(p)) modify(p,0),++p;
if(p==10)return 1;
modify(p,1);
return 0;
}
return 1;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3760kb
input:
1024 10
output:
12345876 -2 0
result:
wrong answer Invalid Operation At Position 0.
Subtask #2:
score: 0
Wrong Answer
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 5120kb
input:
65536 100000
output:
12345876 -3 1 12345876 -3 1
result:
wrong answer Wrong Answer At Query 1.
Subtask #3:
score: 0
Wrong Answer
Test #3:
score: 0
Wrong Answer
time: 1ms
memory: 4996kb
input:
1048576 100000
output:
12345876 -3 1 12345876 -3 1
result:
wrong answer Wrong Answer At Query 1.
Subtask #4:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 1ms
memory: 4920kb
input:
67108864 100000
output:
12345876 -3 1 12345876 -3 1
result:
wrong answer Wrong Answer At Query 1.