답안 #22995 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
22995	2017-05-01T03:08:42 Z	model_code	Tug of War (BOI15_tug)	C++11	71 / 100	3000 ms	7204 KB

/* Tug of War
   Autor: Piotr Smulewicz
   Complexity: O(n^2 * s)
 */
#include <iostream>
#include <numeric>
#include <vector>
#include <cstdlib>
using namespace std;
const int SIZE = 30001;
const int MAX_STRENGHT = 20;
const int BACK_PACK_SIZE = SIZE * MAX_STRENGHT + 1;
int persons[SIZE * 2][2];
int str[SIZE * 2];
bool assigned[SIZE * 2];
vector<int> spots[SIZE * 2];
vector<int> item;
unsigned int opt[SIZE * 2];
bool back_pack[BACK_PACK_SIZE + 1];
int n, j, s, a, b, pe, mi, k, sum_all, sum, res;
int main() {
  ios_base::sync_with_stdio(false);
  res = BACK_PACK_SIZE;
  cin >> n >> k;
  for (size_t i = 0; i < n * 2u; i++) {
    cin >> a >> b >> s;
    str[i] = s;
    persons[i][0] = a * 2;
    persons[i][1] = b * 2 + 1;
    spots[a * 2].push_back(i);
    spots[b * 2 + 1].push_back(i);
  }
  for (size_t s_pe = 0; s_pe < 2u * n; s_pe++) {
    pe = s_pe;
    while (!assigned[pe]) {
      for (j = 0; j < 2; j++) {
        mi = persons[pe][j];
        if (opt[mi] + 1 == spots[mi].size()) {
          assigned[pe] = true;
          sum += (1 - 2 * (mi % 2)) * str[pe];
          mi = persons[pe][1 - j];
          opt[mi]++;
          break;
        }
      }
      if (spots[mi].size() == opt[mi] + 1) {
        unsigned int poz = 0;
        while (assigned[spots[mi][poz]] && poz < spots[mi].size())
          poz++;
        if (poz < spots[mi].size())
          pe = spots[mi][poz];
        else
          break;
      } else
        break;
    }
  }
  item.push_back(abs(sum));
  sum_all += abs(sum);
  for (int s_pe = 0; s_pe < 2 * n; s_pe++) {
    sum = 0;
    pe = s_pe;
    int st = 0;
    int mi2 = persons[pe][1];
    if (assigned[pe])
      continue;
    while (!assigned[pe]) {
      sum += (1 - 2 * st) * str[pe];
      assigned[pe] = true;
      mi = persons[pe][st];
      size_t poz = 0;
      while (poz < spots[mi].size() && assigned[spots[mi][poz]])
        poz++;
      if (poz < spots[mi].size())
        pe = spots[mi][poz];
      st = 1 - st;
    }
    if (mi != mi2) {
      cout << "NO" << endl;
      return 0;
    }
    if (sum != 0)
      item.push_back(abs(sum));
    sum_all += abs(sum);
  }
  back_pack[0] = true;
  for (size_t i = 0; i < item.size(); i++) {
    // cout<<"it"<<item[i]<<endl;
    for (int j = BACK_PACK_SIZE / 2; j >= 0; --j) {
      if (back_pack[j]) {
        back_pack[j + item[i]] = true;
      }
    }
  }
  for (int j = BACK_PACK_SIZE; j >= 0; --j) {
    if (back_pack[j])
      res = min(res, abs(sum_all - 2 * j));
  }
  // cout<<"res "<<res<<" k: "<<k<<endl;
  if (res <= k)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}

Subtask #1
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5168 KB	Output is correct
2	Correct	6 ms	5168 KB	Output is correct
3	Correct	3 ms	5168 KB	Output is correct
4	Correct	3 ms	5168 KB	Output is correct
5	Correct	3 ms	5168 KB	Output is correct
6	Correct	3 ms	5168 KB	Output is correct
7	Correct	3 ms	5168 KB	Output is correct
8	Correct	3 ms	5168 KB	Output is correct
9	Correct	3 ms	5168 KB	Output is correct
10	Correct	0 ms	5168 KB	Output is correct
11	Correct	6 ms	5168 KB	Output is correct
12	Correct	3 ms	5168 KB	Output is correct
13	Correct	3 ms	5168 KB	Output is correct
14	Correct	3 ms	5168 KB	Output is correct
15	Correct	6 ms	5168 KB	Output is correct
16	Correct	3 ms	5168 KB	Output is correct
17	Correct	3 ms	5168 KB	Output is correct
18	Correct	3 ms	5168 KB	Output is correct
19	Correct	3 ms	5168 KB	Output is correct
20	Correct	3 ms	5168 KB	Output is correct
21	Correct	0 ms	5168 KB	Output is correct
22	Correct	0 ms	5168 KB	Output is correct
23	Correct	3 ms	5168 KB	Output is correct
24	Correct	6 ms	5168 KB	Output is correct
25	Correct	3 ms	5168 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5168 KB	Output is correct
2	Correct	6 ms	5168 KB	Output is correct
3	Correct	3 ms	5168 KB	Output is correct
4	Correct	3 ms	5168 KB	Output is correct
5	Correct	3 ms	5168 KB	Output is correct
6	Correct	3 ms	5168 KB	Output is correct
7	Correct	3 ms	5168 KB	Output is correct
8	Correct	3 ms	5168 KB	Output is correct
9	Correct	3 ms	5168 KB	Output is correct
10	Correct	0 ms	5168 KB	Output is correct
11	Correct	6 ms	5168 KB	Output is correct
12	Correct	3 ms	5168 KB	Output is correct
13	Correct	3 ms	5168 KB	Output is correct
14	Correct	3 ms	5168 KB	Output is correct
15	Correct	6 ms	5168 KB	Output is correct
16	Correct	3 ms	5168 KB	Output is correct
17	Correct	3 ms	5168 KB	Output is correct
18	Correct	3 ms	5168 KB	Output is correct
19	Correct	3 ms	5168 KB	Output is correct
20	Correct	3 ms	5168 KB	Output is correct
21	Correct	0 ms	5168 KB	Output is correct
22	Correct	0 ms	5168 KB	Output is correct
23	Correct	3 ms	5168 KB	Output is correct
24	Correct	6 ms	5168 KB	Output is correct
25	Correct	3 ms	5168 KB	Output is correct
26	Correct	543 ms	5300 KB	Output is correct
27	Correct	76 ms	5300 KB	Output is correct
28	Correct	539 ms	5300 KB	Output is correct
29	Correct	79 ms	5300 KB	Output is correct
30	Correct	523 ms	5300 KB	Output is correct
31	Correct	73 ms	5300 KB	Output is correct
32	Correct	549 ms	5300 KB	Output is correct
33	Correct	86 ms	5300 KB	Output is correct
34	Correct	43 ms	5300 KB	Output is correct
35	Correct	86 ms	5300 KB	Output is correct
36	Correct	549 ms	5300 KB	Output is correct
37	Correct	93 ms	5300 KB	Output is correct
38	Correct	539 ms	5300 KB	Output is correct
39	Correct	86 ms	5300 KB	Output is correct
40	Correct	566 ms	5300 KB	Output is correct
41	Correct	69 ms	5300 KB	Output is correct
42	Correct	516 ms	5300 KB	Output is correct
43	Correct	73 ms	5300 KB	Output is correct
44	Correct	513 ms	5300 KB	Output is correct
45	Correct	96 ms	5300 KB	Output is correct
46	Correct	566 ms	5300 KB	Output is correct
47	Correct	0 ms	5300 KB	Output is correct
48	Correct	259 ms	5300 KB	Output is correct
49	Correct	279 ms	5300 KB	Output is correct
50	Correct	623 ms	5300 KB	Output is correct
51	Correct	573 ms	5300 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	5696 KB	Output is correct
2	Correct	13 ms	5696 KB	Output is correct
3	Correct	6 ms	5696 KB	Output is correct
4	Correct	9 ms	5696 KB	Output is correct
5	Correct	16 ms	5696 KB	Output is correct
6	Correct	9 ms	5696 KB	Output is correct
7	Correct	6 ms	5696 KB	Output is correct
8	Correct	9 ms	5696 KB	Output is correct
9	Correct	3 ms	5696 KB	Output is correct
10	Correct	9 ms	5696 KB	Output is correct
11	Correct	6 ms	5696 KB	Output is correct
12	Correct	6 ms	5696 KB	Output is correct
13	Correct	9 ms	5696 KB	Output is correct
14	Correct	6 ms	5696 KB	Output is correct
15	Correct	9 ms	5696 KB	Output is correct
16	Correct	9 ms	5696 KB	Output is correct
17	Correct	9 ms	5696 KB	Output is correct
18	Correct	9 ms	5696 KB	Output is correct
19	Correct	9 ms	5696 KB	Output is correct
20	Correct	9 ms	5696 KB	Output is correct
21	Correct	9 ms	5696 KB	Output is correct
22	Correct	9 ms	5828 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5168 KB	Output is correct
2	Correct	6 ms	5168 KB	Output is correct
3	Correct	3 ms	5168 KB	Output is correct
4	Correct	3 ms	5168 KB	Output is correct
5	Correct	3 ms	5168 KB	Output is correct
6	Correct	3 ms	5168 KB	Output is correct
7	Correct	3 ms	5168 KB	Output is correct
8	Correct	3 ms	5168 KB	Output is correct
9	Correct	3 ms	5168 KB	Output is correct
10	Correct	0 ms	5168 KB	Output is correct
11	Correct	6 ms	5168 KB	Output is correct
12	Correct	3 ms	5168 KB	Output is correct
13	Correct	3 ms	5168 KB	Output is correct
14	Correct	3 ms	5168 KB	Output is correct
15	Correct	6 ms	5168 KB	Output is correct
16	Correct	3 ms	5168 KB	Output is correct
17	Correct	3 ms	5168 KB	Output is correct
18	Correct	3 ms	5168 KB	Output is correct
19	Correct	3 ms	5168 KB	Output is correct
20	Correct	3 ms	5168 KB	Output is correct
21	Correct	0 ms	5168 KB	Output is correct
22	Correct	0 ms	5168 KB	Output is correct
23	Correct	3 ms	5168 KB	Output is correct
24	Correct	6 ms	5168 KB	Output is correct
25	Correct	3 ms	5168 KB	Output is correct
26	Correct	543 ms	5300 KB	Output is correct
27	Correct	76 ms	5300 KB	Output is correct
28	Correct	539 ms	5300 KB	Output is correct
29	Correct	79 ms	5300 KB	Output is correct
30	Correct	523 ms	5300 KB	Output is correct
31	Correct	73 ms	5300 KB	Output is correct
32	Correct	549 ms	5300 KB	Output is correct
33	Correct	86 ms	5300 KB	Output is correct
34	Correct	43 ms	5300 KB	Output is correct
35	Correct	86 ms	5300 KB	Output is correct
36	Correct	549 ms	5300 KB	Output is correct
37	Correct	93 ms	5300 KB	Output is correct
38	Correct	539 ms	5300 KB	Output is correct
39	Correct	86 ms	5300 KB	Output is correct
40	Correct	566 ms	5300 KB	Output is correct
41	Correct	69 ms	5300 KB	Output is correct
42	Correct	516 ms	5300 KB	Output is correct
43	Correct	73 ms	5300 KB	Output is correct
44	Correct	513 ms	5300 KB	Output is correct
45	Correct	96 ms	5300 KB	Output is correct
46	Correct	566 ms	5300 KB	Output is correct
47	Correct	0 ms	5300 KB	Output is correct
48	Correct	259 ms	5300 KB	Output is correct
49	Correct	279 ms	5300 KB	Output is correct
50	Correct	623 ms	5300 KB	Output is correct
51	Correct	573 ms	5300 KB	Output is correct
52	Correct	9 ms	5696 KB	Output is correct
53	Correct	13 ms	5696 KB	Output is correct
54	Correct	6 ms	5696 KB	Output is correct
55	Correct	9 ms	5696 KB	Output is correct
56	Correct	16 ms	5696 KB	Output is correct
57	Correct	9 ms	5696 KB	Output is correct
58	Correct	6 ms	5696 KB	Output is correct
59	Correct	9 ms	5696 KB	Output is correct
60	Correct	3 ms	5696 KB	Output is correct
61	Correct	9 ms	5696 KB	Output is correct
62	Correct	6 ms	5696 KB	Output is correct
63	Correct	6 ms	5696 KB	Output is correct
64	Correct	9 ms	5696 KB	Output is correct
65	Correct	6 ms	5696 KB	Output is correct
66	Correct	9 ms	5696 KB	Output is correct
67	Correct	9 ms	5696 KB	Output is correct
68	Correct	9 ms	5696 KB	Output is correct
69	Correct	9 ms	5696 KB	Output is correct
70	Correct	9 ms	5696 KB	Output is correct
71	Correct	9 ms	5696 KB	Output is correct
72	Correct	9 ms	5696 KB	Output is correct
73	Correct	9 ms	5828 KB	Output is correct
74	Execution timed out	3000 ms	7204 KB	Execution timed out
75	Halted	0 ms	0 KB	-

답안 #22995

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 30.0 / 30.0

Subtask #3 23.0 / 23.0

Subtask #4 0 / 29.0

Subtask #1
18.0 / 18.0

Subtask #2
30.0 / 30.0

Subtask #3
23.0 / 23.0

Subtask #4
0 / 29.0