답안 #240237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
240237	2020-06-18T22:43:33 Z	Dremix10	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	7 ms	1280 KB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define F first
#define S second
//#define endl '\n'
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define maxp 22
#define EPS (ld)(1e-18)
#define mod (int)(1e9+7)
#define N (int)(1e5+1)

bool dp[10005][10005];

vector<int> find_subset(int l, int r, vector<int> arr) {
    int n=arr.size();
    int i,j;

    sort(arr.begin(),arr.end(),greater<int>());

    dp[0][0]=true;
    for(i=1;i<=n;i++)
    for(j=0;j<=10000;j++){
        dp[i][j]|=dp[i-1][j];
        if(j>=arr[i-1])
            dp[i][j]|=dp[i-1][j-arr[i-1]];
    }
    int k;
    for(k=l;k<=r;k++)
    if(dp[n][k]){
        //cout<<n<<" "<<k<<endl;
        vector<int> ans;
        int num=k;
        int row=n;
        while(num>0){
            assert(row>0);
            for(i=row;i>0;i--)
                if(num>=arr[i-1])
            if(dp[i-1][num-arr[i-1]]){
                row=i-1;
                num-=arr[i-1];
                ans.push_back(i-1);
                break;
            }

        }
        return ans;
    }
    return vector<int>(0);
}

Subtask #1

9.0 / 9.0

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

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
2	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
3	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
4	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
5	Incorrect	5 ms	512 KB	sum of weights should be in [290..300] but it is 306
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	4 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	4 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	7 ms	1280 KB	OK (n = 100, answer = NO)
19	Correct	7 ms	1280 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	512 KB	sum of weights should be in [290..300] but it is 306
25	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	4 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	4 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	7 ms	1280 KB	OK (n = 100, answer = NO)
19	Correct	7 ms	1280 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	512 KB	sum of weights should be in [290..300] but it is 306
25	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	4 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	4 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	7 ms	1280 KB	OK (n = 100, answer = NO)
19	Correct	7 ms	1280 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	512 KB	sum of weights should be in [290..300] but it is 306
25	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
2	Correct	4 ms	384 KB	OK (n = 1, answer = NO)
3	Correct	4 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	4 ms	384 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	4 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	384 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	7 ms	1280 KB	OK (n = 100, answer = NO)
19	Correct	7 ms	1280 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	384 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	512 KB	sum of weights should be in [290..300] but it is 306
25	Halted	0 ms	0 KB	-