QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #579574 | #9221. Missing Boundaries | LX1288# | WA | 0ms | 3800kb | C++14 | 506b | 2024-09-21 15:24:35 | 2024-09-21 15:24:36 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,w=0;
char ch=0;
while(ch<48||ch>57)w|=ch==45,ch=getchar();
while(ch>=48&&ch<=57)x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return w?-x:x;
}
const int M=55;
int T,n,m;
int a[M][M],c[5005],h[5005];
bool b[M*M];
int main() {
n=rd();
int mx=0;
for(int i=1; i<=n; i++) {
int mi=1e6;
for(int j=1; j<=n; j++) {
a[i][j]=rd();
mi=min(mi,a[i][j]);
}
mx=max(mx,mi);
}
printf("%d\n",mx);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3800kb
input:
3 4 51 1 -1 11 50 -1 -1 -1 10 3 2 -1 -1 -1 -1 -1 -1 2 3 1 2 2 3
output:
1
result:
wrong answer 1st lines differ - expected: 'TAK', found: '1'