oj.uz

답안 #1052575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052575 2024-08-10T16:38:55 Z cjoa Detecting Molecules (IOI16_molecules) C++17
31 / 100
 12 ms 65536 KB 
#include "molecules.h"

#include <bits/stdc++.h>

using namespace std;

int L, U;
vector<int> W;

//                  i
//      0  1  2  3
// W = [6, 8, 8, 7]

const int MAXN = 10000;
const int MAXU = 10000;

bool cached[MAXN+1][MAXU+2];
bool memo[MAXN+1][MAXU+2];
bool decision[MAXN+1][MAXN+2];
//pair<int,int> parent[MAXN+1][MAXN+2];


// dp(i, espacio) = true si es posible utilizar las moleculas i hasta la ultima
//                  y que el espacio_ocupado se encuentra en el rango de [L, U]

bool dp( int i, int espacio_ocupado ) {
   if (espacio_ocupado > U)
      return false;

   if (i == (int) W.size()) {
      // ya no hay mas moleculas que tomar
      if (L <= espacio_ocupado and espacio_ocupado <= U)
         return true;
      else
         return false;
   }

   if (cached[i][espacio_ocupado])
      return memo[i][espacio_ocupado];

   bool res = false;

   // incluir la molecula i
   if (dp(i + 1, espacio_ocupado + W[i])) {
      decision[i][espacio_ocupado] = true;
   //   parent[i][espacio_ocupado] = {i+1, espacio_ocupado + W[i]};
      res = true;
   }
   
   // excluir la molecula i
   if (!res) {
      if ( dp(i + 1, espacio_ocupado) ) {
         decision[i][espacio_ocupado] = false;
      //   parent[i][espacio_ocupado] = {i+1, espacio_ocupado};
         res = true;
      }
   }

   cached[i][espacio_ocupado] = true;
   memo[i][espacio_ocupado] = res;

   return res;
}







std::vector<int> find_subset(int l, int u, std::vector<int> w) {
   W = w;
   L = l;
   U = u;

   bool can = dp(0, 0);
   if (!can)
      return {};

   vector<int> res;
   for (int i = 0, espacio_ocupado = 0; i < (int) W.size(); ) {
      if (decision[i][espacio_ocupado])
         res.push_back(i);

      int nuevo_i, nuevo_esp;

   //   tie(nuevo_i, nuevo_esp) = parent[i][espacio_ocupado];

      if (decision[i][espacio_ocupado]) {
         nuevo_esp = espacio_ocupado + W[i];
      }
      else {
         nuevo_esp = espacio_ocupado;
      }
      nuevo_i = i+1;

      i = nuevo_i;
      espacio_ocupado = nuevo_esp;
   }
   return res;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 1, answer = NO)
2 Correct 0 ms 2396 KB OK (n = 1, answer = NO)
3 Correct 0 ms 2396 KB OK (n = 1, answer = YES)
4 Correct 0 ms 2396 KB OK (n = 2, answer = YES)
5 Correct 1 ms 2396 KB OK (n = 2, answer = YES)
6 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
11 Correct 1 ms 2396 KB OK (n = 3, answer = YES)
12 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
13 Correct 1 ms 2392 KB OK (n = 3, answer = NO)
14 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
15 Correct 0 ms 2516 KB OK (n = 3, answer = YES)
16 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
17 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
18 Correct 0 ms 4956 KB OK (n = 100, answer = NO)
19 Correct 1 ms 7004 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
2 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
3 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
4 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
5 Correct 1 ms 2392 KB OK (n = 12, answer = YES)
6 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 6, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
11 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
12 Correct 1 ms 7008 KB OK (n = 100, answer = YES)
13 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
14 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
15 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
16 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
17 Correct 1 ms 7012 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 1, answer = NO)
2 Correct 0 ms 2396 KB OK (n = 1, answer = NO)
3 Correct 0 ms 2396 KB OK (n = 1, answer = YES)
4 Correct 0 ms 2396 KB OK (n = 2, answer = YES)
5 Correct 1 ms 2396 KB OK (n = 2, answer = YES)
6 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
11 Correct 1 ms 2396 KB OK (n = 3, answer = YES)
12 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
13 Correct 1 ms 2392 KB OK (n = 3, answer = NO)
14 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
15 Correct 0 ms 2516 KB OK (n = 3, answer = YES)
16 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
17 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
18 Correct 0 ms 4956 KB OK (n = 100, answer = NO)
19 Correct 1 ms 7004 KB OK (n = 100, answer = YES)
20 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
21 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
22 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
23 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
24 Correct 1 ms 2392 KB OK (n = 12, answer = YES)
25 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
26 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
27 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
28 Correct 0 ms 2396 KB OK (n = 6, answer = YES)
29 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
30 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
31 Correct 1 ms 7008 KB OK (n = 100, answer = YES)
32 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
33 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
34 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
35 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
36 Correct 1 ms 7012 KB OK (n = 100, answer = YES)
37 Correct 1 ms 4704 KB OK (n = 28, answer = YES)
38 Correct 1 ms 4712 KB OK (n = 27, answer = YES)
39 Correct 1 ms 7012 KB OK (n = 90, answer = YES)
40 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
41 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
42 Correct 0 ms 2408 KB OK (n = 10, answer = YES)
43 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
44 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
45 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
46 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
47 Correct 2 ms 4956 KB OK (n = 100, answer = NO)
48 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
49 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
50 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
51 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
52 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
53 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
54 Correct 1 ms 7016 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 1, answer = NO)
2 Correct 0 ms 2396 KB OK (n = 1, answer = NO)
3 Correct 0 ms 2396 KB OK (n = 1, answer = YES)
4 Correct 0 ms 2396 KB OK (n = 2, answer = YES)
5 Correct 1 ms 2396 KB OK (n = 2, answer = YES)
6 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
11 Correct 1 ms 2396 KB OK (n = 3, answer = YES)
12 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
13 Correct 1 ms 2392 KB OK (n = 3, answer = NO)
14 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
15 Correct 0 ms 2516 KB OK (n = 3, answer = YES)
16 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
17 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
18 Correct 0 ms 4956 KB OK (n = 100, answer = NO)
19 Correct 1 ms 7004 KB OK (n = 100, answer = YES)
20 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
21 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
22 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
23 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
24 Correct 1 ms 2392 KB OK (n = 12, answer = YES)
25 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
26 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
27 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
28 Correct 0 ms 2396 KB OK (n = 6, answer = YES)
29 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
30 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
31 Correct 1 ms 7008 KB OK (n = 100, answer = YES)
32 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
33 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
34 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
35 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
36 Correct 1 ms 7012 KB OK (n = 100, answer = YES)
37 Correct 1 ms 4704 KB OK (n = 28, answer = YES)
38 Correct 1 ms 4712 KB OK (n = 27, answer = YES)
39 Correct 1 ms 7012 KB OK (n = 90, answer = YES)
40 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
41 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
42 Correct 0 ms 2408 KB OK (n = 10, answer = YES)
43 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
44 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
45 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
46 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
47 Correct 2 ms 4956 KB OK (n = 100, answer = NO)
48 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
49 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
50 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
51 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
52 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
53 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
54 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
55 Runtime error 12 ms 65536 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 1, answer = NO)
2 Correct 0 ms 2396 KB OK (n = 1, answer = NO)
3 Correct 0 ms 2396 KB OK (n = 1, answer = YES)
4 Correct 0 ms 2396 KB OK (n = 2, answer = YES)
5 Correct 1 ms 2396 KB OK (n = 2, answer = YES)
6 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
11 Correct 1 ms 2396 KB OK (n = 3, answer = YES)
12 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
13 Correct 1 ms 2392 KB OK (n = 3, answer = NO)
14 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
15 Correct 0 ms 2516 KB OK (n = 3, answer = YES)
16 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
17 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
18 Correct 0 ms 4956 KB OK (n = 100, answer = NO)
19 Correct 1 ms 7004 KB OK (n = 100, answer = YES)
20 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
21 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
22 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
23 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
24 Correct 1 ms 2392 KB OK (n = 12, answer = YES)
25 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
26 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
27 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
28 Correct 0 ms 2396 KB OK (n = 6, answer = YES)
29 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
30 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
31 Correct 1 ms 7008 KB OK (n = 100, answer = YES)
32 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
33 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
34 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
35 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
36 Correct 1 ms 7012 KB OK (n = 100, answer = YES)
37 Correct 1 ms 4704 KB OK (n = 28, answer = YES)
38 Correct 1 ms 4712 KB OK (n = 27, answer = YES)
39 Correct 1 ms 7012 KB OK (n = 90, answer = YES)
40 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
41 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
42 Correct 0 ms 2408 KB OK (n = 10, answer = YES)
43 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
44 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
45 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
46 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
47 Correct 2 ms 4956 KB OK (n = 100, answer = NO)
48 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
49 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
50 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
51 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
52 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
53 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
54 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
55 Runtime error 12 ms 65536 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB OK (n = 1, answer = NO)
2 Correct 0 ms 2396 KB OK (n = 1, answer = NO)
3 Correct 0 ms 2396 KB OK (n = 1, answer = YES)
4 Correct 0 ms 2396 KB OK (n = 2, answer = YES)
5 Correct 1 ms 2396 KB OK (n = 2, answer = YES)
6 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
7 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
8 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
9 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
10 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
11 Correct 1 ms 2396 KB OK (n = 3, answer = YES)
12 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
13 Correct 1 ms 2392 KB OK (n = 3, answer = NO)
14 Correct 0 ms 2396 KB OK (n = 3, answer = YES)
15 Correct 0 ms 2516 KB OK (n = 3, answer = YES)
16 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
17 Correct 0 ms 2396 KB OK (n = 3, answer = NO)
18 Correct 0 ms 4956 KB OK (n = 100, answer = NO)
19 Correct 1 ms 7004 KB OK (n = 100, answer = YES)
20 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
21 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
22 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
23 Correct 1 ms 2396 KB OK (n = 12, answer = NO)
24 Correct 1 ms 2392 KB OK (n = 12, answer = YES)
25 Correct 1 ms 2396 KB OK (n = 12, answer = YES)
26 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
27 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
28 Correct 0 ms 2396 KB OK (n = 6, answer = YES)
29 Correct 0 ms 2396 KB OK (n = 12, answer = YES)
30 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
31 Correct 1 ms 7008 KB OK (n = 100, answer = YES)
32 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
33 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
34 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
35 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
36 Correct 1 ms 7012 KB OK (n = 100, answer = YES)
37 Correct 1 ms 4704 KB OK (n = 28, answer = YES)
38 Correct 1 ms 4712 KB OK (n = 27, answer = YES)
39 Correct 1 ms 7012 KB OK (n = 90, answer = YES)
40 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
41 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
42 Correct 0 ms 2408 KB OK (n = 10, answer = YES)
43 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
44 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
45 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
46 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
47 Correct 2 ms 4956 KB OK (n = 100, answer = NO)
48 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
49 Correct 1 ms 4968 KB OK (n = 100, answer = NO)
50 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
51 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
52 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
53 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
54 Correct 1 ms 7016 KB OK (n = 100, answer = YES)
55 Runtime error 12 ms 65536 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -