QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #778543 | #9226. Game of Geniuses | Arkhell | WA | 2ms | 3772kb | C++17 | 5.7kb | 2024-11-24 15:07:17 | 2024-11-24 15:07:23 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100;
int g[N][N];
int n;
int r[N];
int c[N];
int visr[N];
int visc[N];
bool cmp(int a,int b){
return a>b;
}
void solve(){
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>g[i][j];
r[i]=1e18;
c[j]=-1e18;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
r[i]=min(r[i],g[i][j]);
}
}
for(int i1=1;i1<=(n-1)*2;i1++){
if(i1&1){
int flag=-1;
vector<int>v;
for(int i=1;i<=n;i++){
if(visr[i]){
continue;
}
if(flag==-1){
flag=i;
for(int j=1;j<=n;j++){
if(visc[j]){
continue;
}
v.push_back(g[i][j]);
}
sort(v.begin(),v.end(),cmp);
}
else if(r[flag]==r[i]){
vector<int>tmp;
for(int j=1;j<=n;j++){
if(visc[j]){
continue;
}
tmp.push_back(g[i][j]);
}
sort(tmp.begin(),tmp.end(),cmp);
int flag1=1;
for(int i=0;i<tmp.size();i++){
if(v[i]==tmp[i]){
continue;
}
if(v[i]>tmp[i]){
flag1=0;
break;
}
break;
}
if(flag1==0){
v.clear();
for(int i=0;i<tmp.size();i++){
v.push_back(tmp[i]);
}
flag=i;
}
}
else if(r[flag]>r[i]){
flag=i;
v.clear();
for(int j=1;j<=n;j++){
if(visc[j]){
continue;
}
v.push_back(g[i][j]);
}
sort(v.begin(),v.end());
}
}
visr[flag]=1;
for(int i=1;i<=n;i++){
c[i]=-1e18;
}
for(int i=1;i<=n;i++){
if(visr[i]){
continue;
}
for(int j=1;j<=n;j++){
if(visc[j]==1){
continue;
}
c[j]=max(c[j],g[i][j]);
}
}
//cout<<flag<<'\n';
}
else{
int flag=-1;
vector<int>v;
for(int i=1;i<=n;i++){
if(visc[i]){
continue;
}
if(flag==-1){
flag=i;
for(int j=1;j<=n;j++){
if(visr[j]){
continue;
}
v.push_back(g[i][j]);
}
sort(v.begin(),v.end());
}
else if(c[flag]==c[i]){
vector<int>tmp;
for(int j=1;j<=n;j++){
if(visr[j]){
continue;
}
tmp.push_back(g[j][i]);
}
sort(tmp.begin(),tmp.end());
int flag1=1;
//cout<<' '<<v[0]<<'\n';
for(int i=0;i<tmp.size();i++){
if(tmp[i]==v[i]){
continue;
}
if(tmp[i]>v[i]){
//cout<<' '<<i<<'\n';
flag1=0;
break;
}
break;
}
if(flag1==0){
flag=i;
v.clear();
for(int i=0;i<tmp.size();i++){
v.push_back(tmp[i]);
}
}
}
else if(c[flag]<c[i]){
flag=i;
v.clear();
for(int j=1;j<=n;j++){
if(visr[j]){
continue;
}
v.push_back(g[i][j]);
sort(v.begin(),v.end());
}
}
}
visc[flag]=1;
for(int i=1;i<=n;i++){
r[i]=1e18;
}
for(int i=1;i<=n;i++){
if(visr[i]){
continue;
}
for(int j=1;j<=n;j++){
if(visc[j]==1){
continue;
}
r[i]=min(r[i],g[i][j]);
}
}
//cout<<flag<<'\n';
}
}
for(int i=1;i<=n;i++){
if(visr[i]){
continue;
}
for(int j=1;j<=n;j++){
if(visc[j]){
continue;
}
cout<<g[i][j];
return;
}
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3568kb
input:
3 1 4 9 8 4 2 7 5 7
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: 0
Accepted
time: 2ms
memory: 3772kb
input:
50 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2392 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 25...
output:
2500
result:
ok 1 number(s): "2500"
Test #3:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
10 87 94 55 220 109 210 17 114 155 34 31 189 14 214 176 130 58 104 33 37 215 116 218 162 91 1503 225 199 222 43 106 79 127 132 65 129 61 105 213 37 249 110 198 178 216 216 169 97 23 227 246 171 177 26 79 120 130 233 128 41 499 594 964 1180 539 1954 1498 1371 986 1325 46 24 91 171 85 255 2217 233 47 ...
output:
499
result:
ok 1 number(s): "499"
Test #4:
score: -100
Wrong Answer
time: 1ms
memory: 3748kb
input:
27 411 303 81 355 191 660 575 150 26 190 659 491 503 105 392 665 710 111 176 25 395 105 234 247 528 641 315 198 707 101 112 342 282 217 457 653 271 261 689 437 155 570 725 386 146 711 498 40 315 502 717 376 52 311 426 271 176 178 365 442 703 547 47 470 633 532 437 634 620 466 539 465 628 8 267 145 2...
output:
378
result:
wrong answer 1st numbers differ - expected: '166', found: '378'