QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#875975#8364. permutationMatutino0 3ms3712kbC++17823b2025-01-30 15:10:222025-01-30 15:10:23

Judging History

This is the latest submission verdict.

  • [2025-01-30 15:10:23]
  • Judged
  • Verdict: 0
  • Time: 3ms
  • Memory: 3712kb
  • [2025-01-30 15:10:22]
  • Submitted

answer

#include<bits/stdc++.h>
#define reg register
#define int long long
inline int read(){
    reg int x=0,k=1; reg char ch=getchar();
    while (ch<'0'||ch>'9') (ch=='-')&&(k=-1),ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*k;
}
const int N=3e5+10;
int n,m,a[20],sta[N],idx,man[20][20];
signed main(){
    n=read(),m=read();
    for (reg int i=1;i<=n;i++) for (reg int j=i+1;j<=n;j++) man[i][j]=idx++;
    for (reg int i=1;i<=m;i++){
        for (reg int j=1;j<=n;j++) a[j]=read();
        for (reg int x=1;x<=n;x++) for (reg int y=x+1;y<=n;y++) if (a[x]>a[y]) sta[i]|=1ll<<man[x][y];
    }
    for (reg int i=1;i<=m;i++){
        reg int ans=0;
        for (reg int j=1;j<=m;j++) ans+=(sta[i]&sta[j])==sta[i];
        printf("%lld\n",ans);
    }
    return 0;
}  

詳細信息

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 3ms
memory: 3712kb

input:

7 2000
5 1 7 4 6 3 2
1 4 6 3 5 2 7
1 3 4 6 2 7 5
6 3 7 1 4 5 2
7 3 6 2 4 1 5
6 7 3 4 1 2 5
6 1 2 5 7 4 3
5 1 4 3 7 6 2
5 3 4 1 2 7 6
7 1 3 4 6 5 2
7 4 6 2 5 1 3
2 6 3 4 1 7 5
5 6 3 1 2 4 7
4 1 6 7 5 3 2
2 6 1 3 7 4 5
1 6 2 3 4 5 7
4 3 1 5 2 7 6
7 3 2 5 4 6 1
2 6 7 1 5 3 4
7 6 2 4 1 5 3
5 1 7 3 6 2 4...

output:

8
66
183
22
9
10
31
17
34
27
6
65
45
11
95
382
68
13
25
7
24
29
3
21
19
8
109
27
42
69
29
5
12
49
7
22
3
39
81
25
20
33
52
12
4
185
4
12
88
11
115
164
1
2
55
9
212
124
97
27
13
60
168
71
5
12
219
16
16
29
27
28
6
46
70
43
77
21
10
11
34
6
38
396
19
9
7
19
7
86
7
69
175
17
11
10
63
50
91
3
12
39
3
35...

result:

wrong answer 1st numbers differ - expected: '57', found: '8'

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Skipped

Dependency #1:

0%

Subtask #4:

score: 0
Skipped

Dependency #2:

0%