oj.uz

답안 #204288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204288 2020-02-25T10:00:34 Z awlintqaa Detecting Molecules (IOI16_molecules) C++14
0 / 100
 6 ms 632 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;
int a[10009];
int dp[2][10009];
int p[10009];
vi id[10009];
vi path(int x){
        vi ret;
        while ( p[x]!=x){
                ret.pb( id[ x-p[x] ].back() );
                id [ x-p[x] ] .pop_back();
                x = p[x];
        }
        return ret;
}
vi find_subset(int l, int u,vi w) {
        n = w.size();
        for ( int i =0 ;i < n;i ++ ){
                id [ w[i] ] .pb (i);
        }
        dp[0][0]=1;
        for(int i =0 ;i < n ;i ++ ){
                for(int j = 0 ;j <= 20 ;j++){
                        if ( j-w[i] >=0 && dp[0][ j -w[i] ] ){
                                dp[1][j] = 1 ;
                                p [j] = j-w[i];
                        }
                        else dp [1][j]=dp[0][j];
                }
                for ( int j =0 ;j <= 20 ;j ++ ) {
                        dp [0][j] = dp[1][j];
                        dp [1][j] = 0;
                }
        }
        for ( int i =l ; i<=u ;i++ ){
                if ( dp [0][i] ){
                        return path(i);
                }
        }
        return std::vector<int>(0);
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB OK (n = 1, answer = NO)
2 Correct 5 ms 632 KB OK (n = 1, answer = NO)
3 Correct 5 ms 504 KB OK (n = 1, answer = YES)
4 Incorrect 5 ms 632 KB Contestant can not find answer, jury can
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 632 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB OK (n = 1, answer = NO)
2 Correct 5 ms 632 KB OK (n = 1, answer = NO)
3 Correct 5 ms 504 KB OK (n = 1, answer = YES)
4 Incorrect 5 ms 632 KB Contestant can not find answer, jury can
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB OK (n = 1, answer = NO)
2 Correct 5 ms 632 KB OK (n = 1, answer = NO)
3 Correct 5 ms 504 KB OK (n = 1, answer = YES)
4 Incorrect 5 ms 632 KB Contestant can not find answer, jury can
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB OK (n = 1, answer = NO)
2 Correct 5 ms 632 KB OK (n = 1, answer = NO)
3 Correct 5 ms 504 KB OK (n = 1, answer = YES)
4 Incorrect 5 ms 632 KB Contestant can not find answer, jury can
5 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB OK (n = 1, answer = NO)
2 Correct 5 ms 632 KB OK (n = 1, answer = NO)
3 Correct 5 ms 504 KB OK (n = 1, answer = YES)
4 Incorrect 5 ms 632 KB Contestant can not find answer, jury can
5 Halted 0 ms 0 KB -