답안 #285666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285666	2020-08-29T11:50:44 Z	SamAnd	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1000 ms	684 KB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int N = 10004;

int n;
int a[N];

bitset<N> dp[N], p[N];

std::vector<int> find_subset(int l, int r, std::vector<int> w)
{
    n = sz(w);
    for (int i = 1; i <= n; ++i)
        a[i] = w[i - 1];

    vector<pair<int, int> > v;
    for (int i = 1; i <= n; ++i)
        v.push_back(m_p(a[i], i - 1));
    sort(all(v));
    for (int i = -1; i < n; ++i)
    {
        for (int j = i + 1; j <= n; ++j)
        {
            ll s = 0;
            for (int k = 0; k < i; ++k)
                s += v[k].fi;
            for (int k = j; k < n; ++k)
                s += v[k].fi;
            if (l <= s && s <= r)
            {
                vector<int> ans;
                for (int k = 0; k < i; ++k)
                    ans.push_back(v[k].se);
                for (int k = j; k < n; ++k)
                    ans.push_back(v[k].se);
                return ans;
            }
        }
    }
    return {};

    dp[0][0] = true;
    for (int i = 1; i <= n; ++i)
    {
        int x = a[i];
        for (int j = 0; j <= r - x; ++j)
        {
            if (dp[i - 1][j])
            {
                dp[i][j + x] = true;
                p[i][j + x] = true;
            }
        }
        for (int j = 0; j <= r; ++j)
        {
            if (dp[i - 1][j])
            {
                dp[i][j] = true;
                p[i][j] = false;
            }
        }
    }
    for (int j = l; j <= r; ++j)
    {
        if (dp[n][j])
        {
            vector<int> ans;
            int x = j;
            for (int i = n; i >= 1; --i)
            {
                if (p[i][x])
                {
                    ans.push_back(i - 1);
                    x -= a[i];
                }
            }
            return ans;
        }
    }
    return {};
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	512 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	328 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	512 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
27	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	384 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	384 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	288 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
55	Correct	30 ms	640 KB	OK (n = 10000, answer = YES)
56	Correct	93 ms	684 KB	OK (n = 10000, answer = YES)
57	Correct	300 ms	672 KB	OK (n = 10000, answer = YES)
58	Correct	183 ms	676 KB	OK (n = 10000, answer = YES)
59	Correct	32 ms	640 KB	OK (n = 10000, answer = YES)
60	Correct	159 ms	672 KB	OK (n = 10000, answer = YES)
61	Execution timed out	1085 ms	640 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	512 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	328 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	512 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
27	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	384 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	384 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	288 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
55	Correct	30 ms	640 KB	OK (n = 10000, answer = YES)
56	Correct	93 ms	684 KB	OK (n = 10000, answer = YES)
57	Correct	300 ms	672 KB	OK (n = 10000, answer = YES)
58	Correct	183 ms	676 KB	OK (n = 10000, answer = YES)
59	Correct	32 ms	640 KB	OK (n = 10000, answer = YES)
60	Correct	159 ms	672 KB	OK (n = 10000, answer = YES)
61	Execution timed out	1085 ms	640 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	512 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	328 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	512 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
27	Correct	0 ms	384 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	384 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	384 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	288 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	384 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
55	Correct	30 ms	640 KB	OK (n = 10000, answer = YES)
56	Correct	93 ms	684 KB	OK (n = 10000, answer = YES)
57	Correct	300 ms	672 KB	OK (n = 10000, answer = YES)
58	Correct	183 ms	676 KB	OK (n = 10000, answer = YES)
59	Correct	32 ms	640 KB	OK (n = 10000, answer = YES)
60	Correct	159 ms	672 KB	OK (n = 10000, answer = YES)
61	Execution timed out	1085 ms	640 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #285666

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 12.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
12.0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0