QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572335#8934. Challenge NPCucup-team073#WA 18ms6732kbC++20569b2024-09-18 13:46:312024-09-18 13:46:32

Judging History

你现在查看的是最新测评结果

  • [2024-09-18 13:46:32]
  • 评测
  • 测评结果:WA
  • 用时:18ms
  • 内存:6732kb
  • [2024-09-18 13:46:31]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
   
const int N=512;
int x[1000000],y[1000000],cnt;
int main(){
  ios::sync_with_stdio(0);
//  int n;cin>>n;
  for(int i=2;i<=N;++i){
    for(int j=N+1;j<N+i;++j){
      x[++cnt]=i;
      y[cnt]=j;
    }
  }
  for(int i=N+2;i<=N+N;++i){
    for(int j=1;j<i-N;++j){
      x[++cnt]=i;
      y[cnt]=j;
    }
  }
  cout<<1024<<' '<<cnt<<' '<<2<<'\n';
  for(int i=1;i<=N;++i)cout<<1<<' ';
  for(int i=1;i<=N;++i)cout<<2<<' ';cout<<'\n';
  for(int i=1;i<=cnt;++i)cout<<x[i]<<' '<<y[i]<<'\n';
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 18ms
memory: 6732kb

input:

1

output:

1024 261632 2
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

wrong answer The graph is not correct