QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#779317#9544. Grand Prix of BallanceoumashuWA 5ms3636kbC++171.3kb2024-11-24 18:21:362024-11-24 18:21:36

Judging History

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

  • [2024-11-24 18:21:36]
  • 评测
  • 测评结果：WA
  • 用时：5ms
  • 内存：3636kb
查看
  • [2024-11-24 18:21:36]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,m,q;
ll r;
struct p{
    int id,mark;
}c[510086];
map<pair<ll,ll>,bool>mp;
bool cmp(p a,p b)
{
    if(a.mark!=b.mark)return a.mark>b.mark;
    else return a.id<b.id;
}
int main()
{
    cin>>t;
    while(t--)
    {
        mp.clear();
        r=0;
        cin>>n>>m>>q;
        int num=m;
        for(int i=1;i<=m;i++)
        {
            c[i].mark=0;
            c[i].id=i;
        }
        while(q--)
        {
            int op;
            cin>>op;
            if(op==1)
            {
                cin>>r;
                num=m;
            }
            else if(op==2)
            {
                int id,x;
                cin>>id>>x;
                if(x==r&&!mp[{id,x}])
                {
                    c[id].mark+=num;
                    num--;
                    mp[{id,x}]=1;
                }
            }
            else if(op==3)
            {
                int id,x;
                cin>>id>>x;
                mp[{id,x}]=1;
            }
        }
        sort(c+1,c+1+m,cmp);
        for(int i=1;i<=m;i++)
        {
            cout<<c[i].id<<" "<<c[i].mark;
            if(i!=m)cout<<"\n";
        }
        cout<<endl;
    }
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3636kb

input:

3
3 4 6
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
3 4 8
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1
2 1 1
3 4 7
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1

output:

2 4
1 3
3 0
4 0
1 7
2 4
3 0
4 0
2 4
1 3
3 0
4 0

result:

ok 12 lines

Test #2:

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

input:

10
18 8 8
2 1 6
1 13
2 1 18
3 8 13
2 7 14
2 5 11
3 6 13
3 1 13
26 7 11
1 22
2 7 22
1 9
2 6 24
1 2
1 18
3 3 4
2 3 18
1 26
3 7 1
3 2 26
1 3 33
3 3 1
2 3 1
2 2 1
1 1
2 1 1
2 1 1
3 1 1
3 3 1
3 2 1
3 3 1
2 2 1
2 2 1
3 3 1
2 2 1
2 2 1
3 3 1
2 3 1
2 3 1
3 3 1
2 3 1
2 2 1
2 2 1
2 2 1
2 1 1
3 2 1
2 2 1
3 2 1...

output:

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

result:

ok 100 lines

Test #3:

score: -100
Wrong Answer
time: 5ms
memory: 3620kb

input:

100
3 51 102
3 35 3
3 40 1
3 34 1
1 3
2 17 3
3 43 3
3 34 3
3 13 3
1 1
3 23 3
2 41 1
3 20 1
2 6 1
2 16 1
2 25 3
3 33 1
3 20 3
3 25 1
3 40 1
2 19 1
3 44 1
1 2
3 23 2
2 47 2
2 33 1
3 1 2
3 29 2
2 34 1
3 14 2
2 37 2
3 49 2
2 18 2
3 14 2
3 17 2
2 41 2
3 27 1
3 4 2
2 6 2
3 12 2
2 36 2
2 46 1
2 41 2
2 4 2
...

output:

41 99
6 97
16 79
17 51
47 51
37 50
18 49
19 48
36 46
31 45
8 44
34 43
25 42
5 41
42 40
39 39
33 38
46 37
40 36
9 35
3 34
20 33
2 32
7 31
1 0
4 0
10 0
11 0
12 0
13 0
14 0
15 0
21 0
22 0
23 0
24 0
26 0
27 0
28 0
29 0
30 0
32 0
35 0
38 0
43 0
44 0
45 0
48 0
49 0
50 0
51 0
10 44
18 44
20 44
3 22
11 22
1...

result:

wrong answer 246th lines differ - expected: '2 4', found: '2 2'
English 繁體中文 简体中文

Server Time: 2024-12-04 18:18:21 | OpenSource Project