답안 #160090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
160090	2019-10-26T02:00:26 Z	Nordway	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	2 ms	376 KB

molecules

#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define nl '\n'

#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

const ll INF=1e18;
const int inf=1e9;
const ld eps=1e-7;
const ld pi=acos(-1);
const int dx[8]={0,0 ,1,-1,1,1,-1,-1};
const int dy[8]={1,-1,0,0,1,-1,1,-1};
const int mod1=998244353;
const int mod2=1e9+7;
const int N=1e4+1;

pii a[N];

vector<int> find_subset(int l,int u,vector<int>w){
  int n=0;
  for(int i=0;i<sz(w);i++){
    if(w[i]>u)continue;
    n++;
    a[n].x=w[i];
    a[n].y=i;
  }
  vector<vector<bool>> dp(n+1,vector<bool>(u+1,0));
  dp[0][0]=1;
  for(int i=1;i<=n;i++){
    for(int j=0;j<=u;j++){
      if(j>=a[i].x)dp[i][j]=dp[i][j]|dp[i-1][j-a[i].x];
      dp[i][j]=dp[i][j]|dp[i-1][j];
    }
  }
  int val=-1;
  for(int i=l;i<=u;i++){
    if(dp[n][i]){
      val=i;
      break;
    }
  }
  vector<int>ans;
  if(val>0){
    while(val>0){
      if(dp[n-1][val-a[n].x]){
        ans.pb(a[n].y);
        val-=a[n].x;
        n--;
      }
      else if(dp[n-1][val]){
        n--;
      }
    }
  }
  return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	OK (n = 12, answer = YES)
2	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
3	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
4	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
5	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
6	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
7	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
12	Runtime error	2 ms	248 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	376 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	252 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Runtime error	2 ms	248 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	376 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	252 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Runtime error	2 ms	248 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	376 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	252 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Runtime error	2 ms	248 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	376 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	252 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Runtime error	2 ms	248 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
32	Halted	0 ms	0 KB	-

답안 #160090

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 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
0 / 10.0

Subtask #3
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0