QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#350893 | #6515. Path Planning | User0069 | WA | 13ms | 5684kb | C++14 | 1.2kb | 2024-03-11 09:32:12 | 2024-03-11 09:32:12 |
Judging History
answer
#include<bits/stdc++.h>
#define taskname ""
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define int ll
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
#define Faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=2e6+6;
const int INF=1e9;
const int mod=1e9+7;
int m,n,x[maxn],y[maxn];
void solve()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
int xx;
cin>>xx;
x[xx]=i;
y[xx]=j;
}
}
int ans=0;
for(int i=1;i<=n+m-1;i++)
{
bool can=1;
for(int j=1;j<i;j++)
{
if((x[j]<x[i]&&y[j]>y[i])||(x[j]>x[i]&&y[j]<y[i])) can=0;
}
if(!can) break;
ans=i;
}
cout<<ans+1<<"\n";
}
signed main()
{
if (fopen(taskname".INP","r"))
{
freopen(taskname".INP","r",stdin);
freopen(taskname".OUT","w",stdout);
}
Faster
int t;
cin>>t;
while(t--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 5600kb
input:
2 2 3 1 2 4 3 0 5 1 5 1 3 0 4 2
output:
3 5
result:
ok 2 number(s): "3 5"
Test #2:
score: -100
Wrong Answer
time: 13ms
memory: 5684kb
input:
10000 2 9 4 0 3 5 2 7 16 11 12 9 13 14 17 10 8 15 1 6 4 8 19 23 22 13 29 4 17 26 30 6 25 3 15 24 18 14 12 8 7 9 27 5 0 10 11 16 31 20 2 28 1 21 1 6 3 2 0 1 4 5 2 3 4 2 0 3 5 1 5 1 4 0 3 2 1 1 3 1 0 2 8 10 9 50 8 0 41 57 60 30 23 65 64 21 36 12 10 5 58 19 38 67 71 52 45 17 77 4 59 51 22 25 56 49 79 2...
output:
9 4 6 3 5 3 14 13 5 9 5 7 6 9 7 4 7 7 13 9 10 9 6 3 5 7 4 2 10 4 18 5 12 3 7 6 9 2 2 5 6 10 8 4 2 5 2 5 7 13 6 10 3 10 3 6 9 8 3 10 2 3 3 8 8 4 7 7 7 8 8 6 6 7 3 8 8 13 3 3 6 5 4 4 10 5 12 7 2 11 6 7 5 10 9 5 4 10 3 5 3 8 7 10 5 4 10 4 6 5 9 4 10 6 4 5 4 4 7 4 8 4 12 5 5 5 8 6 8 3 7 9 3 6 12 5 6 6 6...
result:
wrong answer 2nd numbers differ - expected: '2', found: '4'