QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#582473	#9251. Graph Changing	hezlik	WA	0ms	3712kb	C++20	1.3kb	2024-09-22 16:33:16	2024-09-22 16:33:16

Judging History

你现在查看的是最新测评结果

[2024-09-22 16:33:16]
评测

测评结果：WA
用时：0ms
内存：3712kb

查看

[2024-09-22 16:33:16]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int t,n,k,x,y;
void work(){
  cin>>t>>n>>k>>x>>y; if(x>y) swap(x,y);
  if(t==0){
    cout<<y-x<<'\n'; return;
  }
  if(k==1){
    cout<<1<<'\n'; return;
  }
  if(k==2){
    if(n==2){
      cout<<"-1\n"; return;
    }
    if(n==3){
      if(t==1){
        if(x==1&&y==3){
          cout<<"1\n"; return;
        }
        cout<<"-1\n"; return;
      }
      else{
        cout<<"-1\n"; return;
      }
    }
    if(t%2==0) cout<<y-x<<'\n';
    else{
      if(y-x==1) cout<<2<<'\n';
      else cout<<1<<'\n';
    }
    return;
  }
  if(n<=k){
    cout<<"-1\n"; return;
  }
  if(n>=2*k){
    if(t==1){
      if(y-x>=k) cout<<"1\n";
      else cout<<"2\n";
      return;
    }
    cout<<"-1\n"; return;
  }
  if(k==3){
    if(t==2&&x==2&&y==4&&n==5){
      cout<<1<<'\n'; return;
    }
    if(t>=2){
      cout<<"-1\n"; return;
    }
  }
  if(t==2){
    cout<<"-1\n"; return;
  }
  if(y-x>=k){
    cout<<"1\n"; return;
  }
  if(y-1>=k&&x-1>=k){
    cout<<"2\n"; return;
  }
  if(n-y>=k&&n-x>=k){
    cout<<"2\n"; return;
  }
  cout<<"3\n"; return;
}

int main(){
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  int T=1;
  std::cin>>T;
  for (;T--;) work();
  return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3708kb

input:

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

result:

ok 30 lines

Test #3:

score: 0

Accepted

time: 0ms

memory: 3708kb

input:

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

result:

ok 90 lines

Test #4:

score: -100

Wrong Answer

time: 0ms

memory: 3560kb

input:

output:

1
1
1
1
1
1
2
1
1
2
1
2
3
3
1
3
3
3
-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
2
3
1
2
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
2
1
1
2
1
2
-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
2
3
...

result:

wrong answer 10th lines differ - expected: '3', found: '2'