QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#552081	#9251. Graph Changing	ucup-team1198^#	WA	1ms	3636kb	C++20	1.9kb	2024-09-07 20:25:27	2024-09-07 20:25:27

Judging History

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

[2024-09-07 20:25:27]
评测

测评结果：WA
用时：1ms
内存：3636kb

查看

[2024-09-07 20:25:27]
提交

answer

#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int t, n, k, x, y;
  cin >> t >> n >> k >> x >> y;
  if (x > y) swap(x, y);
  if (t == 0) {
    cout << y - x << "\n";
    return;
  }
  if (t == 1) {
    if (y - x >= k) {
      cout << "1\n";
      return;
    }
    if (n - y >= k || x - 1 >= k) {
      cout << "2\n";
      return;
    } 
    if (n - x >= k && y - 1 >= k) {
      cout << "3\n";
      return;
    }
    cout << "-1\n";
    return;
  }
  if (k == 1) {
    cout << "1\n";
    return;
  }
  if (k == 2) {
    if (n <= 3) {
      cout << "-1\n";
      return;
    }
    t %= 2;
    if (t == 0) {
      cout << y - x << "\n";
      return;
    }
    if (t == 1) {
      if (y - x >= k) {
        cout << "1\n";
        return;
      }
      if (n - y >= k || x - 1 >= k) {
        cout << "2\n";
        return;
      } 
      if (n - x >= k && y - 1 >= k) {
        cout << "3\n";
        return;
      }
      cout << "-1\n";
      return;
    }
  }
  if (k == 3 && n <= 7) {
    if (t > 2) {
      cout << "-1\n";
      return;
    }
    if (x == 3 && y == 5 && n == 7) {
      cout << "1\n";
      return;
    }
    if (x == 2 && y == 4 && n == 6) {
      cout << "1\n";
      return;
    }
    if (x == 3 && y == 5 && n == 6) {
      cout << "1\n";
      return;
    }
    if (x == 2 && y == 4 && n == 5) {
      cout << "1\n";
      return;
    }
    cout << "-1\n";
    return;
  }
  cout << "-1\n";
  return;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  int tst;
  cin >> tst;
  while (tst--) {
    solve();
  }
  
  return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3628kb

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: 3616kb

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: 0

Accepted

time: 0ms

memory: 3584kb

input:

output:

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

result:

ok 180 lines

Test #5:

score: 0

Accepted

time: 1ms

memory: 3576kb

input:

output:

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

result:

ok 300 lines

Test #6:

score: -100

Wrong Answer

time: 0ms

memory: 3636kb

input:

output:

result:

wrong answer 126th lines differ - expected: '2', found: '-1'