QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#288183#5446. 琪露诺的符卡交换catagory#20 2ms4724kbC++231.1kb2023-12-22 09:21:042024-07-04 03:14:36

Judging History

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

  • [2024-07-04 03:14:36]
  • 评测
  • 测评结果:20
  • 用时:2ms
  • 内存:4724kb
  • [2023-12-22 09:21:04]
  • 提交

answer

#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
using namespace std;
long long read(){
  long long q=0,w=1;
  char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
void writeln(LL x){write(x);puts("");}
void writecs(LL x){write(x);putchar(' ');}

#define x1 x_tmp_1
#define y1 y_tmp_1

const long long N = 200+95;
long long T,n,a[N][N];vector<vector<LL>>ans;
void make(LL x0,LL y0,LL x1,LL y1){
  if((x0==x1)&&(y0==y1))return ;
  ans.push_back({x0,y0,x1,y1});
  return ;
}
int main(){
  T=read();
  while(T--){
    n=read();
    for(LL t=1;t<=n;t++)
      for(LL i=1;i<=n;i++)a[t][i]=read();
    ans.clear();
    for(LL i=1;i<=n;i++)
      for(LL j=i;j<=n;j++)
	make(i,j,j,i);
    writeln(SZ(ans));
    for(LL t=0;t<SZ(ans);t++){
      for(LL i=0;i<SZ(ans[t]);i++)writecs(ans[t][i]);
      puts("");
    }
  }
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 20
Accepted

Test #1:

score: 20
Accepted
time: 2ms
memory: 4296kb

input:

7
132
96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 ...

output:

8646
1 2 2 1 
1 3 3 1 
1 4 4 1 
1 5 5 1 
1 6 6 1 
1 7 7 1 
1 8 8 1 
1 9 9 1 
1 10 10 1 
1 11 11 1 
1 12 12 1 
1 13 13 1 
1 14 14 1 
1 15 15 1 
1 16 16 1 
1 17 17 1 
1 18 18 1 
1 19 19 1 
1 20 20 1 
1 21 21 1 
1 22 22 1 
1 23 23 1 
1 24 24 1 
1 25 25 1 
1 26 26 1 
1 27 27 1 
1 28 28 1 
1 29 29 1 
1 3...

result:

ok your solution is correct.

Test #2:

score: 0
Accepted
time: 0ms
memory: 4280kb

input:

8
14
13 13 13 13 13 13 13 13 13 13 13 13 13 13
7 7 7 7 7 7 7 7 7 7 7 7 7 7
8 8 8 8 8 8 8 8 8 8 8 8 8 8
14 14 14 14 14 14 14 14 14 14 14 14 14 14
5 5 5 5 5 5 5 5 5 5 5 5 5 5
4 4 4 4 4 4 4 4 4 4 4 4 4 4
1 1 1 1 1 1 1 1 1 1 1 1 1 1
10 10 10 10 10 10 10 10 10 10 10 10 10 10
2 2 2 2 2 2 2 2 2 2 2 2 2 2
9...

output:

91
1 2 2 1 
1 3 3 1 
1 4 4 1 
1 5 5 1 
1 6 6 1 
1 7 7 1 
1 8 8 1 
1 9 9 1 
1 10 10 1 
1 11 11 1 
1 12 12 1 
1 13 13 1 
1 14 14 1 
2 3 3 2 
2 4 4 2 
2 5 5 2 
2 6 6 2 
2 7 7 2 
2 8 8 2 
2 9 9 2 
2 10 10 2 
2 11 11 2 
2 12 12 2 
2 13 13 2 
2 14 14 2 
3 4 4 3 
3 5 5 3 
3 6 6 3 
3 7 7 3 
3 8 8 3 
3 9 9 3...

result:

ok your solution is correct.

Test #3:

score: 0
Accepted
time: 1ms
memory: 4084kb

input:

4
82
20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 1...

output:

3321
1 2 2 1 
1 3 3 1 
1 4 4 1 
1 5 5 1 
1 6 6 1 
1 7 7 1 
1 8 8 1 
1 9 9 1 
1 10 10 1 
1 11 11 1 
1 12 12 1 
1 13 13 1 
1 14 14 1 
1 15 15 1 
1 16 16 1 
1 17 17 1 
1 18 18 1 
1 19 19 1 
1 20 20 1 
1 21 21 1 
1 22 22 1 
1 23 23 1 
1 24 24 1 
1 25 25 1 
1 26 26 1 
1 27 27 1 
1 28 28 1 
1 29 29 1 
1 3...

result:

ok your solution is correct.

Test #4:

score: 0
Accepted
time: 0ms
memory: 4724kb

input:

8
3
1 1 1
3 3 3
2 2 2
3
1 1 1
3 3 3
2 2 2
1
1
11
5 5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3 3 3
1 1 1 1 1 1 1 1 1 1 1
9 9 9 9 9 9 9 9 9 9 9
4 4 4 4 4 4 4 4 4 4 4
11 11 11 11 11 11 11 11 11 11 11
2 2 2 2 2 2 2 2 2 2 2
6 6 6 6 6 6 6 6 6 6 6
8 8 8 8 8 8 8 8 8 8 8
10 10 10 10 10 10 10 10 10 10 10
7 7 7 7 7...

output:

3
1 2 2 1 
1 3 3 1 
2 3 3 2 
3
1 2 2 1 
1 3 3 1 
2 3 3 2 
0
55
1 2 2 1 
1 3 3 1 
1 4 4 1 
1 5 5 1 
1 6 6 1 
1 7 7 1 
1 8 8 1 
1 9 9 1 
1 10 10 1 
1 11 11 1 
2 3 3 2 
2 4 4 2 
2 5 5 2 
2 6 6 2 
2 7 7 2 
2 8 8 2 
2 9 9 2 
2 10 10 2 
2 11 11 2 
3 4 4 3 
3 5 5 3 
3 6 6 3 
3 7 7 3 
3 8 8 3 
3 9 9 3 
3 10...

result:

ok your solution is correct.

Subtask #2:

score: 0
Wrong Answer

Dependency #1:

100%
Accepted

Test #5:

score: 0
Wrong Answer
time: 2ms
memory: 4460kb

input:

5
17
9 9 9 9 9 9 9 9 9 9 9 9 9 2 9 9 9
5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6
2 2 2 2 2 2 2 2 2 2 2 2 11 2 2 2 2
4 4 4 4 4 4 10 4 4 4 4 4 4 4 4 4 4
10 10 10 10 10 10 8 10 10 10 10 10 10 10 10 10 10
12 12 12 12 12 12 12 12 12 12 12 12 14 12 12 12 12
14 14 14 14 14 14 14 14 14 14 14 12 14 14 14 14 14
16 16...

output:

136
1 2 2 1 
1 3 3 1 
1 4 4 1 
1 5 5 1 
1 6 6 1 
1 7 7 1 
1 8 8 1 
1 9 9 1 
1 10 10 1 
1 11 11 1 
1 12 12 1 
1 13 13 1 
1 14 14 1 
1 15 15 1 
1 16 16 1 
1 17 17 1 
2 3 3 2 
2 4 4 2 
2 5 5 2 
2 6 6 2 
2 7 7 2 
2 8 8 2 
2 9 9 2 
2 10 10 2 
2 11 11 2 
2 12 12 2 
2 13 13 2 
2 14 14 2 
2 15 15 2 
2 16 16...

result:

wrong answer exist a kind of card which a person don't hold.

Subtask #3:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

0%