oj.uz

Submission #727717

# Submission time Handle Problem Language Result Execution time Memory
727717 2023-04-21T07:21:18 Z AdamGS Tug of War (BOI15_tug) C++17
0 / 100
 7 ms 3804 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=3e4+7;
vector<int>V[2*LIM], jakie[2*LIM];
int odw[LIM], T[2*LIM];
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n;
  cin >> n;
  rep(i, 2*n) {
    int a, b;
    cin >> a >> b >> T[i]; --a; --b;
    jakie[a].pb(i);
    jakie[n+b].pb(i);
  }
  rep(i, 2*n) if(jakie[i].size()!=2) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Incorrect 2 ms 3028 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Incorrect 2 ms 3028 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 3804 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Incorrect 2 ms 3028 KB Output isn't correct
3 Halted 0 ms 0 KB -