QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #710078 | #8230. Submissions | heyuhao | RE | 3ms | 15436kb | C++20 | 6.2kb | 2024-11-04 18:31:29 | 2024-11-04 18:31:30 |
Judging History
answer
#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include<map>
#include<vector>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";
using namespace std;
const int Mod = 998244353;
using ll = long long;
map<string,int> tname;
int pos,m,sum_team;
struct submission
{
int num;
string name;
int time,pro;
bool zt;
}sub[100010];
bool cmp(submission a,submission b)
{
if(a.name!=b.name)
return a.name<b.name;
if(a.pro!=b.pro)
return a.pro<b.pro;
if(a.time!=b.time)
return a.time<b.time;
if(a.num!=b.num)
return a.num<b.num;
}
struct problem
{
int num_sub=0,sum_time=0,less_time=0;
bool flag=false;
int index;
};
struct team
{
string name;
int guo,fa;
// int start,end;
vector<problem> pro;
}tea[100010];
bool cmp1(pair<pair<int,int>,string> a,pair<pair<int,int>,string> b)
{
if(a.first.first!=b.first.first)
return a.first.first>b.first.first;
return a.first.second<b.first.second;
}
void solve()
{
map<string,int> ans,ans1;
int m;
cin>>m;
tname.clear();
sum_team=0;
for(int i=1;i<=m;i++)
{
sub[i].num=i;
string c,p,s;
int t;
cin>>c>>p>>t>>s;
sub[i].name=c;
sub[i].pro=p[0]-'A';
sub[i].time=t;
if(s=="accepted")
sub[i].zt=true;
else
sub[i].zt=false;
}
sort(sub+1,sub+1+m,cmp);
pos=1;
while(pos<=m)
{
string name=sub[pos].name; //当前队名
tname[name]=++sum_team;
bool flag=false; //是否过题
int guo=0,fa=0; //过题数和罚时
tea[sum_team].name=name;
tea[sum_team].pro.clear();
while(sub[pos].name==name&&pos<=m)
{
problem x;
x.index=sub[pos].pro;
x.less_time=sub[pos].time;
int pro=sub[pos].pro; //当前题目
bool flag1=false; //是否过题
int ti=0; //罚时
// cout<<name<<" "<<pro<<" "<<mint<<"\n";
while(sub[pos].pro==pro&&sub[pos].name==name&&pos<=m)
{
if(!flag1)
x.num_sub++;
if(sub[pos].zt&&flag1==false)
{
flag1=true;
ti+=sub[pos].time;
}
else if(!flag1)
ti+=20;
pos++;
}
x.flag=flag1;
if(flag1)
{
flag=true;
x.sum_time=ti;
guo++;
fa+=ti;
}
tea[sum_team].pro.push_back(x);
}
tea[sum_team].guo=guo;
tea[sum_team].fa=fa;
}
int stdguo=0,stdfa=0;
int stasum=0;
{
vector<pair<pair<int,int>,string>> all;
for(int j=1;j<=sum_team;j++)
if(tea[j].guo>0)
all.push_back({{tea[j].guo,tea[j].fa},tea[j].name});
sort(all.begin(),all.end(),cmp1);
int ssum=all.size();
stasum=ssum;
// cout<<ssum<<"\n";
int gold=min(35,(ssum+9)/10);
int stguo=all[gold-1].first.first,stfa=all[gold-1].first.second;
stdguo=stguo;
stdfa=stfa;
if(gold<all.size())
stdguo=all[gold].first.first,stdfa=all[gold].first.second;
for(auto c:all)
{
if(c.first.first>stguo||c.first.first==stguo&&c.first.second<=stfa)
ans[c.second]=1,ans1[c.second]=1;
}
}
bool flag6=false,flag7=false;
if(stasum%10!=0)
flag6=true;
if(stasum%10!=1)
flag7=true;
for(int i=1;i<=m;i++)
{
pos=tname[sub[i].name];
string name=sub[i].name;
int index=sub[i].pro;
int shun=sub[i].num;
int l=i,r=i;
if(sub[i].zt&&!ans1.count(name))
continue;
if(sub[i].zt==false&&ans.count(name)&&(flag6||tea[pos].guo>0))
continue;
while(l>0&&sub[l].name==name&&sub[l].pro==index)
l--;
while(r<=m&&sub[r].name==name&&sub[r].pro==index)
r++;
l++;
r--;
bool flag5=false;
int xinti=0;
for(int j=l;j<=r;j++)
{
bool zt=sub[j].zt;
if(sub[j].num==shun)
zt=1-zt;
if(zt&&flag5==false)
{
flag5=true;
xinti+=sub[j].time;
}
else if(!flag5)
{
xinti+=20;
}
}
int xinguo=0,xinfa=0;
for(auto c:tea[pos].pro)
{
if(c.index==index)
{
if(flag5)
{
xinguo++;
xinfa+=xinti;
}
}
else
{
if(c.flag)
{
xinguo++;
xinfa+=c.sum_time;
}
}
}
// cout<<xinguo<<"\n";
vector<pair<pair<int,int>,string>> all;
for(int j=1;j<=sum_team;j++)
{
if(j==pos&&xinguo>0&&(xinguo>stdguo||xinguo==stdguo&&xinfa<=stdfa))
{
// cout<<i<<" 1 "<<xinguo<<" "<<xinfa<<" "<<name<<"\n";
all.push_back({{xinguo,xinfa},name});
}
else if(j!=pos&&tea[j].guo>0&&(tea[j].guo>stdguo||tea[j].guo==stdguo&&tea[j].fa<=stdfa))
{
// cout<<i<<" 2 "<<tea[j].guo<<" "<<tea[j].fa<<" "<<tea[j].name<<"\n";
all.push_back({{tea[j].guo,tea[j].fa},tea[j].name});
}
}
sort(all.begin(),all.end(),cmp1);
int ssum=stasum;
// cout<<ssum<<"\n";
if(flag6==false&&tea[pos].guo==0)
ssum++;
if(flag7==false&&xinguo==0)
ssum--;
int gold=min(35,(ssum+9)/10);
int stguo=all[gold-1].first.first,stfa=all[gold-1].first.second;
for(auto c:all)
{
if(c.first.first>stguo||c.first.first==stguo&&c.first.second<=stfa)
ans[c.second]=1;
}
}
cout<<ans.size()<<"\n";
for(auto s:ans)
{
cout<<s.first<<" ";
}
cout<<"\n";
}
int main()
{
IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int t;
t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 15368kb
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 TS1 TSxingxing10 4 AllWayTheNorth ImYourFan LetItRot XuejunXinyoudui1
result:
ok 2 test cases ok. (2 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 15436kb
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 jiangly_fan 1 conqueror_of_tourist
result:
ok 2 test cases ok. (2 test cases)
Test #3:
score: 0
Accepted
time: 0ms
memory: 15280kb
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 B C D E F G H I J K 1 A
result:
ok 2 test cases ok. (2 test cases)
Test #4:
score: 0
Accepted
time: 0ms
memory: 15396kb
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: -100
Runtime Error
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...