QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #492460 | #9156. 百万富翁 | tuxuanming2024# | 15 | 614ms | 30976kb | C++14 | 1.2kb | 2024-07-26 12:32:42 | 2024-07-26 12:32:42 |
Judging History
answer
#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
int mx[1005][1005];
void work(vector<int>&p,int B,int t)
{
while(t--&&(int)p.size()>1)
{
int sz=p.size();
vector<int>a,b;
map<pair<int,int>,int>mx;
for(int i=0;i<sz;i+=B)
{
for(int j=i;j<min(sz,i+B);j++)
for(int k=j+1;k<min(sz,i+B);k++) a.push_back(p[j]),b.push_back(p[k]);
}
vector<int>c=ask(a,b),q;
for(int i=0;i<(int)a.size();i++) mx[{a[i],b[i]}]=mx[{b[i],a[i]}]=c[i];
for(int i=0;i<sz;i+=B)
{
int res=p[i];
for(int j=i+1;j<min(sz,i+B);j++)
if(mx[{res,p[j]}]==p[j]) res=p[j];
q.push_back(res);
}
p=q;
}
}
int richest(int n, int T, int S)
{
if(T==1)
{
vector<int>a,b;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++) a.push_back(i),b.push_back(j);
vector<int>c=ask(a,b);
for(int i=0,k=0;i<n;i++)
for(int j=i+1;j<n;j++) mx[i][j]=c[k++];
int ans=0;
for(int i=1;i<n;i++) if(mx[ans][i]==i) ans=i;
return ans;
}
vector<int>p;
for(int i=0;i<n;i++) p.push_back(i);
work(p,2,4);
work(p,5,5);
work(p,20,114514);
return p[0];
}
/*
g++ grader.cpp richest.cpp -o richest -O2 -std=c++14 -static && ./richest
*/
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 15
Accepted
time: 595ms
memory: 29544kb
input:
1000 1 499500 957319859
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Pretest #2:
score: 0
Time Limit Exceeded
input:
1000000 20 2000000 29091473
output:
Unauthorized output
result:
Final Tests
Test #1:
score: 15
Accepted
time: 614ms
memory: 30976kb
input:
1000 1 499500 957319857
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Test #2:
score: 0
Time Limit Exceeded
input:
1000000 20 2000000 29091471
output:
Unauthorized output