QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#734081#9544. Grand Prix of BallancerdcamelotRE 0ms3840kbC++201.5kb2024-11-10 23:49:032024-11-10 23:49:04

Judging History

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

  • [2024-11-10 23:49:04]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3840kb
  • [2024-11-10 23:49:03]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using u64=unsigned long long;
#define ll long long
const int inf=1e9;
const ll inff=1e18;
using i128=__int128;

void solve(){
    int n,m,q;
    cin>>n>>m>>q;
    int pro=m;
    int cur=0;
    vector<int> cnt(m);
    vector<int> vis(m);
    while(q--){
        int op;
        cin>>op;
        if(op==1){
            int x;
            cin>>x;
            cur=x;
            vis=vector<int>(n);
            pro=m;
        }else if(op==2){
            int id,level;
            cin>>id>>level;
            id--;
            if(level!=cur){
                continue;
            }
            if(vis[id]!=0){
                continue;
            }
            vis[id]=1;
            cnt[id]+=pro--;
        }else if(op==3){
            int id,level;
            cin>>id>>level;
            id--;
            if(level!=cur){
                continue;
            }
            if(vis[id]!=0){
                continue;
            }
            vis[id]=-1;
        }
    } 
    vector<int> ans(m);
    iota(ans.begin(),ans.end(),0);
    sort(ans.begin(),ans.end(),[&](int x,int y){
        if(cnt[x]==cnt[y]){
            return x<y;
        }
        return cnt[x]>cnt[y];
    });
    for(int i=0;i<m;i++){
        cout<<ans[i]+1<<' '<<cnt[ans[i]]<<'\n';
    }
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int t=1;
    cin>>t; 
    while(t--){
        solve();
    }
    return 0;
}


详细

Test #1:

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

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: 3840kb

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
Runtime Error

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:


result: