QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #502100 | #9156. 百万富翁 | hypeskynick# | 0 | 66ms | 20040kb | C++14 | 622b | 2024-08-03 00:59:20 | 2024-08-03 00:59:26 |
Judging History
answer
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include "richest.h"
using namespace std;
int solveSmall(int n,int s){//task 1 is just a n^2 brute force
//simmilar to first explore task
//surely
vector<int> x,y;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
x.emplace_back(i),y.emplace_back(j);
}
}
vector<int> z=ask(x,y),cnt(n);//ask-2005 refrence 0-0
for(int i=0;i<n;i++){
cnt[z[i]]++;
}
return *max_element(cnt.begin(),cnt.end());
}
int solveLarge(int n,int s){
}
int richest(int n, int t,int s){
if(t==1)return solveSmall(n,s);
return solveLarge(n,s);
}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 0
Wrong Answer
time: 66ms
memory: 19980kb
input:
1000 1 499500 957319859
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer
Pretest #2:
score: 0
Memory Limit Exceeded
input:
1000000 20 2000000 29091473
output:
Unauthorized output
result:
Final Tests
Test #1:
score: 0
Wrong Answer
time: 62ms
memory: 20040kb
input:
1000 1 499500 957319857
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer
Test #2:
score: 0
Memory Limit Exceeded
input:
1000000 20 2000000 29091471
output:
Unauthorized output