QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #344607 | #8230. Submissions | zzuqy | WA | 79ms | 16720kb | C++14 | 5.5kb | 2024-03-04 20:22:59 | 2024-03-04 20:23:00 |
Judging History
answer
#include<bits/stdc++.h>
#define N 200009
using namespace std;
int a[N][26][4];//0 now;1 highest;2 lowest
unordered_map<string,int>mp;
string rmp[N];
int n,n2;
bool cmp(const pair<int,int> &a,const pair<int,int>&b){
if(a.first>b.first)return 1;
if(a.first<b.first)return 0;
if(a.second<b.second)return 1;
return 0;
}
struct mapstruct{
bool operator()(const pair<int,int> &a,const pair<int,int>&b){
return cmp(a,b);
}
};
int calcgold(int n){
return min((n+9)/10,35);
}
bool in[N];
int goldsize=0;
map<pair<int,int>,int,mapstruct>gold;
vector<int>gold2[N];
pair<int,int>line;
void handle(){
int x=calcgold(n2);
int cnt=0;
//assert(gold.size()<=x+1);
for(auto i:gold){
if(cnt<x)for(auto j:gold2[i.second])in[j]=1,cnt++;
else break;
//cout<<cnt<<"?"<<x<<endl;
}
}
void del(int x,pair<int,int>score){
if(score.first>0)n2--;
if(!cmp(line,score)){
int id=gold[score];
for(int i=0;i<gold2[id].size();i++){
if(gold2[id][i]==x){
swap(gold2[id][i],gold2[id][gold2[id].size()-1]);
gold2[id].pop_back();
break;
}
}
if(gold2[id].size()==0)gold.erase(score);
}
}
void add(int x,pair<int,int>score){
if(score.first>0)n2++;
//cout<<score.first<<" "<<score.second<<endl;
if(!cmp(line,score)){
if(gold[score]==0){
gold[score]=++goldsize;
gold2[goldsize].clear();
}
gold2[gold[score]].push_back(x);
}
}
void query(int x,pair<int,int>normal,pair<int,int>score){
del(x,normal);
add(x,score);
handle();
del(x,score);
add(x,normal);
}
void solve(){
mp.clear();n=n2=0;line=make_pair(0,0);
gold.clear();goldsize=0;
int m;cin>>m;
while(m--){
string s;char c;int t;string p;
cin>>s>>c>>t>>p;
if(mp[s]==0){
mp[s]=++n;rmp[n]=s;
for(int i=0;i<26;i++)a[n][i][0]=a[n][i][1]=a[n][i][2]=-1000000000;
}
int x=mp[s],id=c-'A';
if(p=="accepted"){
if(a[x][id][0]<0)a[x][id][0]=a[x][id][0]+1000000000+t,a[x][id][2]+=20;
else a[x][id][2]=a[x][id][2]+1000000000+t;
//cout<<x<<" "<<id<<" "<<a[x][id][2]<<endl;
if(a[x][id][1]<0)a[x][id][1]=t;
}
if(p=="rejected"){
if(a[x][id][0]<0)a[x][id][0]+=20,a[x][id][3]=t;
if(a[x][id][1]<0)a[x][id][1]=t;
if(a[x][id][2]<0)a[x][id][2]+=20;
}
}
for(int i=1;i<=n;i++){
int c=0,p=0;
for(int j=0;j<26;j++)if(a[i][j][0]>=0)c++,p+=a[i][j][0];
if(gold[make_pair(c,p)]==0){
gold[make_pair(c,p)]=++goldsize;
gold2[goldsize].clear();
}
gold2[gold[make_pair(c,p)]].push_back(i);
if(c>0)n2++;
//cout<<rmp[i]<<" "<<c<<" "<<p<<endl;
}
int cnt=0;
for(auto it:gold){
line=it.first;
cnt+=gold2[it.second].size();
if(cnt>calcgold(n2))break;
}
while(1){
auto it=gold.end();it--;
if(cmp(line,(*it).first))gold.erase(it);
else break;
}
handle();
for(int i=1;i<=n;i++){
pair<int,int>best=make_pair(-1000,0),worst=make_pair(1000,0),normal=make_pair(0,0);
for(int x=0;x<26;x++)if(a[i][x][0]>=0)normal.first++,normal.second+=a[i][x][0];
int c=0,p=0;
for(int x=0;x<26;x++){
c=0;p=0;
if(a[i][x][0]>=0)c--,p-=a[i][x][0];
if(a[i][x][1]>=0)c++,p+=a[i][x][1];
if(cmp(make_pair(c,p),best))best=make_pair(c,p);
}
best.first+=normal.first;best.second+=normal.second;
for(int x=0;x<26;x++){
c=0;p=0;
if(a[i][x][0]>=0)c--,p-=a[i][x][0];
if(a[i][x][2]>=0)c++,p+=a[i][x][2];
if(cmp(worst,make_pair(c,p)))worst=make_pair(c,p);
}
worst.first+=normal.first;worst.second+=normal.second;
pair<int,int>what=make_pair(0,0);
for(int x=0;x<26;x++){
if(a[i][x][0]<0&&a[i][x][0]>-1000000000)what.second=max(what.second,a[i][x][0]-20+1000000000+a[i][x][3]+1);
}
//cout<<normal.first<<"-"<<normal.second<<" ";
//cout<<best.first<<"-"<<best.second<<" ";
//cout<<worst.first<<"-"<<worst.second<<" ";
if(normal!=best){
//if(cmp(best,line))in[i]=1;
if(!cmp(line,best)&&normal.first!=0);
else query(i,normal,best);
}
if(normal!=worst&&!cmp(line,normal))query(i,normal,worst);
if(normal.first==0&&what.second){
what.first++;what.second--;
//cout<<what.first<<"-"<<what.second<<" ";
query(i,normal,what);
}
//cout<<endl;
}
int ans=0;
for(int i=1;i<=n;i++)if(in[i])ans++;
cout<<ans<<endl;
for(int i=1;i<=n;i++)if(in[i])cout<<rmp[i]<<" ";cout<<endl;
for(int i=1;i<=n;i++){
rmp[i]="";in[i]=0;
for(int j=0;j<26;j++)a[i][j][0]=a[i][j][1]=a[i][j][2]=0;
}
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
ios::sync_with_stdio(false);
int t;cin>>t;
while(t--)solve();
return 0;
}
/*
2
5
TSxingxing10 G 0 rejected
TSxingxing10 B 83 accepted
aoliaoligeiliao J 98 accepted
TS1 J 118 accepted
TS1 B 263 accepted
12
AllWayTheNorth A 0 rejected
YaoYaoLingXian Y 10 accepted
XuejunXinyoudui1 X 200 rejected
XuejunXinyoudui1 X 200 accepted
LetItRot L 215 accepted
AllWayTheNorth W 250 accepted
ImYourFan I 257 accepted
ImYourFan Y 257 accepted
AllWayTheNorth T 264 accepted
XuejunXinyoudui1 J 294 accepted
LetItRot I 299 accepted
LetItRot I 299 rejected
2
2
jiangly_fan A 1 accepted
jiangly B 23 accepted
3
conqueror_of_tourist A 1 accepted
conqueror_of_tourist A 2 accepted
tourist B 23 accepted
2
13
A A 1 accepted
A X 1 accepted
K K 1 rejected
B B 2 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 accepted
G G 2 accepted
H H 2 accepted
I I 2 accepted
J J 2 accepted
K K 1 rejected
12
A A 1 accepted
A X 1 accepted
B B 2 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 accepted
G G 2 accepted
H H 2 accepted
I I 2 accepted
J J 2 rejected
K K 2 rejected
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 16704kb
input:
2 5 TSxingxing10 G 0 rejected TSxingxing10 B 83 accepted aoliaoligeiliao J 98 accepted TS1 J 118 accepted TS1 B 263 accepted 12 AllWayTheNorth A 0 rejected YaoYaoLingXian Y 10 accepted XuejunXinyoudui1 X 200 rejected XuejunXinyoudui1 X 200 accepted LetItRot L 215 accepted AllWayTheNorth W 250 accept...
output:
2 TSxingxing10 TS1 4 AllWayTheNorth XuejunXinyoudui1 LetItRot ImYourFan
result:
ok 2 test cases ok. (2 test cases)
Test #2:
score: 0
Accepted
time: 2ms
memory: 16720kb
input:
2 2 jiangly_fan A 1 accepted jiangly B 23 accepted 3 conqueror_of_tourist A 1 accepted conqueror_of_tourist A 2 accepted tourist B 23 accepted
output:
2 jiangly_fan jiangly 1 conqueror_of_tourist
result:
ok 2 test cases ok. (2 test cases)
Test #3:
score: 0
Accepted
time: 2ms
memory: 16680kb
input:
2 13 A A 1 accepted A X 1 accepted K K 1 rejected B B 2 accepted C C 2 accepted D D 2 accepted E E 2 accepted F F 2 accepted G G 2 accepted H H 2 accepted I I 2 accepted J J 2 accepted K K 2 rejected 12 A A 1 accepted A X 1 accepted B B 2 accepted C C 2 accepted D D 2 accepted E E 2 accepted F F 2 a...
output:
11 A K B C D E F G H I J 1 A
result:
ok 2 test cases ok. (2 test cases)
Test #4:
score: 0
Accepted
time: 0ms
memory: 16536kb
input:
2 11 A A 1 accepted B B 1 accepted C C 2 accepted D D 2 accepted E E 2 accepted F F 2 accepted G G 2 accepted H H 2 accepted I I 2 accepted J J 2 accepted K K 2 accepted 12 A A 1 accepted A X 1 accepted K K 1 rejected B B 2 accepted C C 2 accepted D D 2 accepted E E 2 accepted F F 2 accepted G G 2 a...
output:
2 A B 2 A K
result:
ok 2 test cases ok. (2 test cases)
Test #5:
score: 0
Accepted
time: 79ms
memory: 16184kb
input:
100000 1 M3JytWoaEXxkACy_mBAQ R 111 accepted 1 sQ O 151 accepted 1 JinbrcS58gNEE5yTSkT B 140 accepted 1 cklwBY V 243 accepted 1 v_o42YmvEKFwy Q 260 rejected 1 ftQVK8S_um22w K 265 accepted 1 _bQBeFeDpYQhvZcLf9l3 Z 147 accepted 1 KvDcEAIDN A 75 rejected 1 H3MUK6 A 101 rejected 1 gxYo_oCFn2J8aIben U 54...
output:
1 M3JytWoaEXxkACy_mBAQ 1 sQ 1 JinbrcS58gNEE5yTSkT 1 cklwBY 1 v_o42YmvEKFwy 1 ftQVK8S_um22w 1 _bQBeFeDpYQhvZcLf9l3 1 KvDcEAIDN 1 H3MUK6 1 gxYo_oCFn2J8aIben 1 _isnlUGK0ddI 1 BERcVjyCp 1 6In2do_50ylch 1 f0r3SXc6brMjT 1 7njYOapSwvogA 1 x 1 y1w3KvxylfxwprRBYw 1 aGedzS 1 iPo0GDhIF 1 4Vf...
result:
ok 100000 test cases ok. (100000 test cases)
Test #6:
score: -100
Wrong Answer
time: 47ms
memory: 15896kb
input:
10000 42 Bzs0PiQMXGZ5rRZ_2D G 2 accepted 9XtB_VIfbRRL E 11 accepted FVJL M 13 rejected a S 19 accepted tsd Z 20 rejected MyCqVEg1ONjZ U 22 accepted 6SgZMn N 51 rejected Qua1Pti3vKhyQKDUm P 54 accepted i29 M 63 accepted zPqu D 68 rejected xx2yiu6x C 71 rejected fYuK1KNkuyO5HRCq L 76 rejected tXWpYVqj...
output:
3 Qua1Pti3vKhyQKDUm fYuK1KNkuyO5HRCq xiLm0TUOF3T 2 t3 JP 2 fhYPGC8W82NwJTQL 77sgqpbTIr_Zt1 2 pVWDEz 3BQ 2 tg buCeoOotAkV8DaFD6 1 UkXQ3iaNJ 2 ALTqPt7JUSLrl vwfw 1 QTEzV6tp 2 wJlbqIU 9cy_y_RNRwex8j7224hz 2 eiuF7a_ 6mbCu5zA 1 xy6QBr8ECi 3 ldaKLZb1oS1sS _Yej1PrINtydmOudwoO PezeyUurYoz7N1iGU ...
result:
wrong answer the numbers are different in the case 1. (test case 1)