Submission #299413

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
299413	2020-09-14T21:13:00 Z	sandoval	Detecting Molecules (IOI16_molecules)	C++11	19 / 100	1 ms	384 KB

molecules

#include <bits/stdc++.h>
using namespace std;
using ii = pair<int,int>;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
  if (l > u) return {};

  const int n = (int)w.size();
  map<ll,int> m;
  m[0] = 0;
  ll sum = 0;

  for (int i = 1; i <= (int)n; ++i) {
    sum += w[i-1];
    ll k = sum-l;
    auto it = m.upper_bound(k);
    if (it != m.begin()) {
      it = prev(it);
      ll o = sum-it->first;
      assert(o >= l);
      if (o <= u) {
        const int len = i-it->second;
        vector<int> res;
        for (int j = i-len+1, c = 0; j <= i; ++j, ++c) {
          res.push_back(j-1);
        }
        return res;
      }
    }
    m[sum] = i;
  }

  return {};
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	256 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
2	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
3	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
4	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
5	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 6, answer = YES)
10	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
11	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
12	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
14	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
15	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
17	Correct	1 ms	256 KB	OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Submission #299413

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 12.0

Subtask #4 0 / 15.0

Subtask #5 0 / 23.0

Subtask #6 0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0