QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #647520 | #4883. Bayan Testing | ship2077 | WA | 16ms | 3876kb | C++23 | 871b | 2024-10-17 14:33:29 | 2024-10-17 14:33:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int M=2e5+5;
int n,m,num,cur,ans[M];
struct info{ int l,r;
bool operator <(const info &a) const
{return r==a.r?l<a.l:r<a.r;}
}a[M];
int read(){
int x=0;char ch=getchar();
while (!isdigit(ch)) ch=getchar();
while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
return x;
}
void solve(){
n=read();m=read();num=0;
for (int i=1;i<=m<<1;i++){
int l=read(),r=read();
if (l<r) a[++num]={l,r};
}
if (num<m) return puts("-1"),void();
sort(a+1,a+num+1); int cur=a[num-m].r+1;
for (int i=1;i<=cur;i++) ans[i]=i;
if (a[num-m].r==a[num-m+1].r) ans[a[num-m+1].l]=cur;
for (int i=a[num-m+1].r-1;i<=n;i++) ans[i]=cur;
for (int i=1;i<=n;i++) printf("%d%c",ans[i]," \n"[i==n]);
}
int main(){int T=read();while (T--) solve();return 0;}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3876kb
input:
3 2 1 1 1 2 2 6 2 1 3 4 6 2 4 3 5 4 3 1 2 1 1 2 2 2 3 3 3 3 4
output:
-1 1 2 3 5 5 5 1 1 1 1
result:
ok ok (3 test cases)
Test #2:
score: 0
Accepted
time: 8ms
memory: 3812kb
input:
100000 2 1 1 1 2 2 2 1 2 2 1 2 2 1 1 2 2 2 2 1 1 2 2 2 2 1 2 2 1 2 2 1 2 2 1 1 2 1 1 1 2 2 2 1 1 2 2 2 2 1 2 2 1 1 2 1 2 2 1 2 2 1 2 2 1 1 2 1 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1 1 2 1 2 2 1 1 2 1 1 2 2 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1 1 1 2 2 2 1 2 2 1 2 2 1 1 1 2 2 2 1 1 1 2 2 2 1 2 2 1 2 2 1 2...
output:
-1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 -...
result:
ok ok (100000 test cases)
Test #3:
score: -100
Wrong Answer
time: 16ms
memory: 3784kb
input:
25000 10 5 4 10 1 4 9 9 2 9 5 8 1 8 1 5 5 5 4 9 6 6 11 5 9 11 4 7 2 2 2 5 8 10 3 11 2 4 4 8 3 10 4 6 5 2 1 3 4 4 1 5 5 5 6 3 4 6 3 3 1 5 3 6 1 1 1 3 7 3 4 4 3 5 1 6 3 4 2 3 1 2 7 3 3 4 1 5 6 7 2 6 3 5 2 3 5 2 5 5 4 5 2 3 1 1 10 5 3 6 4 5 3 3 6 9 2 5 9 10 5 6 5 7 1 4 8 9 11 5 1 10 2 11 6 9 2 6 6 6 8 ...
output:
1 2 3 4 5 6 6 6 6 6 1 2 3 4 5 6 8 8 8 8 8 1 1 1 1 1 1 2 3 4 4 4 1 2 4 4 4 4 4 1 2 6 6 6 6 6 1 1 1 1 1 1 2 3 4 7 7 7 7 7 7 1 2 3 4 5 6 7 8 10 10 10 1 2 3 7 7 7 7 7 1 2 3 4 5 6 8 8 8 8 1 2 3 4 6 6 6 6 1 2 3 4 5 6 7 10 10 10 10 10 10 10 10 10 10 1 2 3 4 5 6 7 8 10 10 10 10 10 1 2 3 3 3 3 1 2 3 4 5 8 8 ...
result:
wrong answer the number of segments with two equal elements is 5 != 3 (test case 6)