oj.uz

Submission #204204

# Submission time Handle Problem Language Result Execution time Memory
204204 2020-02-25T08:08:20 Z awlintqaa Detecting Molecules (IOI16_molecules) C++14
0 / 100
 1000 ms 760 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "molecules.h"
int n ,L,R;
vi v;
int a[100009];
bool dp[10009][10009];
bool done[10009][10009];
bool bt(int id,int sum){
        if ( id == n ){
                return (L<=sum && sum<=R);
        }
        bool &ret=dp[id][sum];
        if(done[id][sum])return ret;
        ret = 0;
        ret = max ( bt(id+1,sum) , bt(id+1,sum+a[id]) );
        return ret;
}
void path(int id,int sum){
        if ( id == n)return ;
        bool ans = bt(id,sum);
        bool ret1=bt(id+1,sum);
        if ( ret1 == ans){
                path(id+1,sum);
                return ;
        }
        v.pb(id);
        path(id+1,sum+a[id]);
}
vi find_subset(int l, int u, vi w) {
        n=w.size();
        for(int i =0 ;i < n;i ++ ){
                a[i]=w[i];
        }
        L =l ,R = u;
        if ( bt(0,0) ){
                path(0,0);
                return v;
        }
        return std::vector<int>(0);
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB OK (n = 12, answer = YES)
2 Correct 5 ms 376 KB OK (n = 12, answer = YES)
3 Correct 5 ms 376 KB OK (n = 12, answer = NO)
4 Correct 5 ms 376 KB OK (n = 12, answer = NO)
5 Correct 5 ms 376 KB OK (n = 12, answer = YES)
6 Correct 5 ms 376 KB OK (n = 12, answer = YES)
7 Correct 5 ms 376 KB OK (n = 12, answer = YES)
8 Correct 5 ms 380 KB OK (n = 12, answer = YES)
9 Correct 5 ms 376 KB OK (n = 6, answer = YES)
10 Correct 5 ms 376 KB OK (n = 12, answer = YES)
11 Execution timed out 1081 ms 760 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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