oj.uz

Submission #22996

# Submission time Handle Problem Language Result Execution time Memory
22996 2017-05-01T03:10:12 Z model_code Tug of War (BOI15_tug) C++11
18 / 100
 3000 ms 4124 KB 
/* Tug of War
   Autor: Piotr Smulewicz
   Backtracking
 */

#include <iostream>
#include <numeric>
#include <vector>
#include <cstdlib>
using namespace std;
const int SIZE = 30001;
const int MAX_STRENGHT = 20;
int persons[SIZE * 2][2];
int str[SIZE * 2];
bool spots[SIZE * 2][2];
int n, k, a, b, s;
bool backtrack(int pe, int st) {
  if (pe < n * 2) {
    for (int i = 0; i < 2; i++)
      if (!spots[persons[pe][i]][i]) {
        spots[persons[pe][i]][i] = true;
        if (backtrack(pe + 1, st + (1 - 2 * i) * str[pe]))
          return true;
        spots[persons[pe][i]][i] = false;
      }
  } else if (abs(st) <= k) {
    return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  for (size_t i = 0; i < n * 2u; i++) {
    cin >> a >> b >> s;
    str[i] = s;
    persons[i][0] = a;
    persons[i][1] = b;
  }
  if (backtrack(0, 0))
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3000 KB Output is correct
2 Correct 0 ms 3000 KB Output is correct
3 Correct 0 ms 3000 KB Output is correct
4 Correct 0 ms 3000 KB Output is correct
5 Correct 0 ms 3000 KB Output is correct
6 Correct 0 ms 3000 KB Output is correct
7 Correct 0 ms 3000 KB Output is correct
8 Correct 0 ms 3000 KB Output is correct
9 Correct 0 ms 3000 KB Output is correct
10 Correct 0 ms 3000 KB Output is correct
11 Correct 0 ms 3000 KB Output is correct
12 Correct 0 ms 3000 KB Output is correct
13 Correct 0 ms 3000 KB Output is correct
14 Correct 0 ms 3000 KB Output is correct
15 Correct 0 ms 3000 KB Output is correct
16 Correct 0 ms 3000 KB Output is correct
17 Correct 0 ms 3000 KB Output is correct
18 Correct 0 ms 3000 KB Output is correct
19 Correct 0 ms 3000 KB Output is correct
20 Correct 0 ms 3000 KB Output is correct
21 Correct 0 ms 3000 KB Output is correct
22 Correct 0 ms 3000 KB Output is correct
23 Correct 0 ms 3000 KB Output is correct
24 Correct 0 ms 3000 KB Output is correct
25 Correct 0 ms 3000 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3000 KB Output is correct
2 Correct 0 ms 3000 KB Output is correct
3 Correct 0 ms 3000 KB Output is correct
4 Correct 0 ms 3000 KB Output is correct
5 Correct 0 ms 3000 KB Output is correct
6 Correct 0 ms 3000 KB Output is correct
7 Correct 0 ms 3000 KB Output is correct
8 Correct 0 ms 3000 KB Output is correct
9 Correct 0 ms 3000 KB Output is correct
10 Correct 0 ms 3000 KB Output is correct
11 Correct 0 ms 3000 KB Output is correct
12 Correct 0 ms 3000 KB Output is correct
13 Correct 0 ms 3000 KB Output is correct
14 Correct 0 ms 3000 KB Output is correct
15 Correct 0 ms 3000 KB Output is correct
16 Correct 0 ms 3000 KB Output is correct
17 Correct 0 ms 3000 KB Output is correct
18 Correct 0 ms 3000 KB Output is correct
19 Correct 0 ms 3000 KB Output is correct
20 Correct 0 ms 3000 KB Output is correct
21 Correct 0 ms 3000 KB Output is correct
22 Correct 0 ms 3000 KB Output is correct
23 Correct 0 ms 3000 KB Output is correct
24 Correct 0 ms 3000 KB Output is correct
25 Correct 0 ms 3000 KB Output is correct
26 Correct 0 ms 3124 KB Output is correct
27 Execution timed out 3000 ms 3000 KB Execution timed out
28 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4124 KB Output is correct
2 Execution timed out 3000 ms 3000 KB Execution timed out
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3000 KB Output is correct
2 Correct 0 ms 3000 KB Output is correct
3 Correct 0 ms 3000 KB Output is correct
4 Correct 0 ms 3000 KB Output is correct
5 Correct 0 ms 3000 KB Output is correct
6 Correct 0 ms 3000 KB Output is correct
7 Correct 0 ms 3000 KB Output is correct
8 Correct 0 ms 3000 KB Output is correct
9 Correct 0 ms 3000 KB Output is correct
10 Correct 0 ms 3000 KB Output is correct
11 Correct 0 ms 3000 KB Output is correct
12 Correct 0 ms 3000 KB Output is correct
13 Correct 0 ms 3000 KB Output is correct
14 Correct 0 ms 3000 KB Output is correct
15 Correct 0 ms 3000 KB Output is correct
16 Correct 0 ms 3000 KB Output is correct
17 Correct 0 ms 3000 KB Output is correct
18 Correct 0 ms 3000 KB Output is correct
19 Correct 0 ms 3000 KB Output is correct
20 Correct 0 ms 3000 KB Output is correct
21 Correct 0 ms 3000 KB Output is correct
22 Correct 0 ms 3000 KB Output is correct
23 Correct 0 ms 3000 KB Output is correct
24 Correct 0 ms 3000 KB Output is correct
25 Correct 0 ms 3000 KB Output is correct
26 Correct 0 ms 3124 KB Output is correct
27 Execution timed out 3000 ms 3000 KB Execution timed out
28 Halted 0 ms 0 KB -