QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #534259 | #9221. Missing Boundaries | hhu_yjh# | WA | 99ms | 7728kb | C++14 | 1.6kb | 2024-08-26 23:07:15 | 2024-08-26 23:07:15 |
Judging History
answer
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
typedef pair<int,int> PII;
const int N=1e7+10;
int mp[100][100];
int n;
vector<bool> stx(100),sty(100);
struct node{
int l, r;
int type;
bool operator <(const node& x) const{
if(this->l!=x.l) return this->l<x.l;
return this->r<x.r;
}
};
void solve(){
cin>>n;
int l;
cin>>l;
vector<node> vc;
int cnt=0;
int x=0;
for(int i=1;i<=n;i++){
int l,r;
cin>>l>>r;
if(l==-1&&r==-1){
cnt++;
}else{
if(l==-1){
vc.push_back({r,r,1});x++;
}else if(r==-1){
vc.push_back({l,l,-1});x++;
}else{
vc.push_back({l,r,0});x+=r-l+1;
}
}
}
sort(vc.begin(),vc.end());
for(int i=1;i<vc.size();i++){
if(vc[i].l<=vc[i-1].r){
cout<<"NIE"<<endl;
return;
}
}
for(int i=1;i<vc.size();i++){
if((vc[i-1].type>=0&&vc[i].type<=0)){
if(vc[i-1].r+1!=vc[i].l){
cout<<"NIE"<<endl;
return;
}
}
}
int need=0;
if(vc.size()){
if(vc[0].l!=1&&vc[0].type<=0) need++;
if(vc[vc.size()-1].r!=l&&vc[vc.size()-1].type>=0) need++;
}
if(l-x>=cnt&&cnt>=need){
cout<<"TAK"<<endl;
}else cout<<"NIE"<<endl;
}
int main(){
int t;
cin>>t;
// t=1;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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:
TAK NIE NIE
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 99ms
memory: 7728kb
input:
1 200000 1000000000 490669427 -1 224278942 224287156 821104480 -1 861696576 861702036 807438935 807440055 574078002 574083717 465630141 -1 195378188 -1 -1 13500961 -1 977536179 92893115 -1 -1 661145418 -1 215804863 -1 685338515 544348999 -1 465532902 -1 130346949 -1 -1 526666304 635604584 635605404 ...
output:
TAK
result:
ok single line: 'TAK'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3516kb
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:
TAK NIE NIE
result:
ok 3 lines
Test #4:
score: -100
Wrong Answer
time: 73ms
memory: 7332kb
input:
1 197838 400000 34167 34169 352180 -1 235963 -1 -1 -1 160401 160405 347288 -1 270353 270354 214502 214504 183243 183245 -1 -1 -1 36193 -1 -1 -1 17557 273498 273500 269137 -1 395099 395100 285515 285518 -1 -1 71041 71042 324060 -1 -1 385151 -1 379645 -1 -1 -1 185142 -1 191584 89259 89261 328347 32834...
output:
NIE
result:
wrong answer 1st lines differ - expected: 'TAK', found: 'NIE'