oj.uz

Submission #160101

# Submission time Handle Problem Language Result Execution time Memory
160101 2019-10-26T02:52:31 Z Nordway Detecting Molecules (IOI16_molecules) C++14
0 / 100
 1000 ms 6656 KB 
#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;
  }
  bitset<500001>dp[n+1];
  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]=dp[i-1]<<a[i].x;
      }
      dp[i]|=(dp[i-1]);
    }
  }
  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(val>=a[n].x&&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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 632 KB OK (n = 1, answer = YES)
4 Correct 6 ms 632 KB OK (n = 2, answer = YES)
5 Correct 4 ms 632 KB OK (n = 2, answer = YES)
6 Correct 2 ms 632 KB OK (n = 3, answer = YES)
7 Correct 3 ms 632 KB OK (n = 3, answer = YES)
8 Correct 3 ms 632 KB OK (n = 3, answer = YES)
9 Correct 3 ms 632 KB OK (n = 3, answer = YES)
10 Correct 3 ms 632 KB OK (n = 3, answer = YES)
11 Correct 2 ms 632 KB OK (n = 3, answer = YES)
12 Correct 3 ms 632 KB OK (n = 3, answer = YES)
13 Correct 3 ms 632 KB OK (n = 3, answer = NO)
14 Correct 3 ms 760 KB OK (n = 3, answer = YES)
15 Correct 4 ms 760 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 4 ms 760 KB OK (n = 3, answer = NO)
18 Execution timed out 1078 ms 6648 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 1144 KB OK (n = 12, answer = YES)
2 Correct 109 ms 1272 KB OK (n = 12, answer = YES)
3 Correct 112 ms 1272 KB OK (n = 12, answer = NO)
4 Correct 104 ms 1276 KB OK (n = 12, answer = NO)
5 Correct 106 ms 1272 KB OK (n = 12, answer = YES)
6 Correct 109 ms 1272 KB OK (n = 12, answer = YES)
7 Correct 118 ms 1272 KB OK (n = 12, answer = YES)
8 Correct 106 ms 1300 KB OK (n = 12, answer = YES)
9 Correct 6 ms 888 KB OK (n = 6, answer = YES)
10 Correct 10 ms 1304 KB OK (n = 12, answer = YES)
11 Correct 495 ms 6656 KB OK (n = 100, answer = NO)
12 Correct 182 ms 6648 KB OK (n = 100, answer = YES)
13 Execution timed out 1064 ms 6648 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 632 KB OK (n = 1, answer = YES)
4 Correct 6 ms 632 KB OK (n = 2, answer = YES)
5 Correct 4 ms 632 KB OK (n = 2, answer = YES)
6 Correct 2 ms 632 KB OK (n = 3, answer = YES)
7 Correct 3 ms 632 KB OK (n = 3, answer = YES)
8 Correct 3 ms 632 KB OK (n = 3, answer = YES)
9 Correct 3 ms 632 KB OK (n = 3, answer = YES)
10 Correct 3 ms 632 KB OK (n = 3, answer = YES)
11 Correct 2 ms 632 KB OK (n = 3, answer = YES)
12 Correct 3 ms 632 KB OK (n = 3, answer = YES)
13 Correct 3 ms 632 KB OK (n = 3, answer = NO)
14 Correct 3 ms 760 KB OK (n = 3, answer = YES)
15 Correct 4 ms 760 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 4 ms 760 KB OK (n = 3, answer = NO)
18 Execution timed out 1078 ms 6648 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 632 KB OK (n = 1, answer = YES)
4 Correct 6 ms 632 KB OK (n = 2, answer = YES)
5 Correct 4 ms 632 KB OK (n = 2, answer = YES)
6 Correct 2 ms 632 KB OK (n = 3, answer = YES)
7 Correct 3 ms 632 KB OK (n = 3, answer = YES)
8 Correct 3 ms 632 KB OK (n = 3, answer = YES)
9 Correct 3 ms 632 KB OK (n = 3, answer = YES)
10 Correct 3 ms 632 KB OK (n = 3, answer = YES)
11 Correct 2 ms 632 KB OK (n = 3, answer = YES)
12 Correct 3 ms 632 KB OK (n = 3, answer = YES)
13 Correct 3 ms 632 KB OK (n = 3, answer = NO)
14 Correct 3 ms 760 KB OK (n = 3, answer = YES)
15 Correct 4 ms 760 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 4 ms 760 KB OK (n = 3, answer = NO)
18 Execution timed out 1078 ms 6648 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 632 KB OK (n = 1, answer = YES)
4 Correct 6 ms 632 KB OK (n = 2, answer = YES)
5 Correct 4 ms 632 KB OK (n = 2, answer = YES)
6 Correct 2 ms 632 KB OK (n = 3, answer = YES)
7 Correct 3 ms 632 KB OK (n = 3, answer = YES)
8 Correct 3 ms 632 KB OK (n = 3, answer = YES)
9 Correct 3 ms 632 KB OK (n = 3, answer = YES)
10 Correct 3 ms 632 KB OK (n = 3, answer = YES)
11 Correct 2 ms 632 KB OK (n = 3, answer = YES)
12 Correct 3 ms 632 KB OK (n = 3, answer = YES)
13 Correct 3 ms 632 KB OK (n = 3, answer = NO)
14 Correct 3 ms 760 KB OK (n = 3, answer = YES)
15 Correct 4 ms 760 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 4 ms 760 KB OK (n = 3, answer = NO)
18 Execution timed out 1078 ms 6648 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 632 KB OK (n = 1, answer = YES)
4 Correct 6 ms 632 KB OK (n = 2, answer = YES)
5 Correct 4 ms 632 KB OK (n = 2, answer = YES)
6 Correct 2 ms 632 KB OK (n = 3, answer = YES)
7 Correct 3 ms 632 KB OK (n = 3, answer = YES)
8 Correct 3 ms 632 KB OK (n = 3, answer = YES)
9 Correct 3 ms 632 KB OK (n = 3, answer = YES)
10 Correct 3 ms 632 KB OK (n = 3, answer = YES)
11 Correct 2 ms 632 KB OK (n = 3, answer = YES)
12 Correct 3 ms 632 KB OK (n = 3, answer = YES)
13 Correct 3 ms 632 KB OK (n = 3, answer = NO)
14 Correct 3 ms 760 KB OK (n = 3, answer = YES)
15 Correct 4 ms 760 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 4 ms 760 KB OK (n = 3, answer = NO)
18 Execution timed out 1078 ms 6648 KB Time limit exceeded
19 Halted 0 ms 0 KB -