QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #541848 | #8934. Challenge NPC | ucup-team3474# | WA | 21ms | 8308kb | C++20 | 674b | 2024-08-31 21:09:43 | 2024-08-31 21:09:43 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k;
ll a[N],b[N];
char s[N];
typedef struct{
int x,y,z;
}Node;
Node e[N];
vector<PII> v;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>k;
n=1024;
for(int i=1;i<=n;i++){
int bg;
if(i&1) bg=2;
else bg=1;
for(int j=bg;j<=i;j+=2) v.push_back({j,i});
}
cout<<n<<" "<<v.size()<<" "<<2<<endl;
for(int i=1;i<=n;i++){
if(i&1) cout<<1<<" ";
else cout<<2<<" ";
}
cout<<endl;
for(auto [x,y]:v) cout<<x<<" "<<y<<"\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 21ms
memory: 8308kb
input:
1
output:
1024 262144 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ...
result:
wrong answer The graph is not correct