QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#732243 | #9544. Grand Prix of Ballance | votienkhoa | ML | 0ms | 0kb | C++17 | 2.5kb | 2024-11-10 13:46:00 | 2024-11-10 13:46:00 |
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<pair<int,int>,int>> vpiii;
#define that ios_base::sync_with_stdio(false);
#define summer "or maybe fall?";
#define I cin.tie(NULL);
#define had "just a thing of the past";
#define you cout.tie(NULL);
#define dbg(x) cout << #x << " = " << x << endl;
#define vdbg(v) for(auto x : v) cout << x.fi << " "; cout << endl; for(auto x : v) cout << x.se << " "; cout << endl;
#define in(a) for (auto &x : (a)) cin >> x
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define For(i,a,b) for(int i=a; i<b; i++)
#define Fora(i,a,b) for(int i=a; i<=b; i++)
#define Fore(i,a,b) for(int i=b; i>=a; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define unmap unordered_map
#define pq priority_queue
const int N = 2e5 + 1;
const int mod = 1e9 + 7;
bool cmp(pair<int,int> a, pair<int,int> b){
if (a.se == b.se) return a.fi < b.fi;
return a.se > b.se;
}
void solve() {
int n,m,q; cin >> n >> m >> q;
int cur_level = 0;
int level[N];
int level_point[N];
int giveup[N][N];
int complete[N][N];
mii player;
memset(level,0,sizeof(level));
memset(giveup, 0, sizeof(giveup));
memset(complete, 0, sizeof(complete));
For(i,1,n+1) level_point[i] = m;
while(q--){
//--------------------
int type; cin >> type;
if (type == 1){
cin >> cur_level;
}
else if (type == 2){
int id,x; cin >> id >> x;
if (x == cur_level && giveup[id][x] == 0 && complete[id][x] == 0){
player[id] += level_point[x];
level_point[x]--;
complete[id][x] = 1;
}
}
else if (type == 3){
int id,x; cin >> id >> x;
if (x == cur_level) giveup[id][x] = 1;
}
}
vpii res;
Fora(i,1,m){
res.pb({i,player[i]});
}
sort(all(res), cmp);
for (auto x : res){
cout << x.fi << " " << x.se << endl;
}
}
signed main(){
//that summer I had you
if(fopen("banhmi.txt", "r")){
freopen("banhmi.txt", "r", stdin);
freopen( "banhbao.txt", "w", stdout);
}
int t; cin >> t;
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Memory Limit Exceeded
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