oj.uz

답안 #288844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288844 2020-09-02T01:19:54 Z Basilhijaz Detecting Molecules (IOI16_molecules) C++17
0 / 100
 1 ms 384 KB 
#include "molecules.h"
#include<bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5;
bool dp[N][N];
int n;
vector<int> ans;
bool ok = 0;
void get(vector<int> arr, int i, int sum, vector<int> an){
    if(ok)return;
    if(i == 0 && sum != 0 && dp[n - 1][sum]){
        an.push_back(i);
        for(int a = 0; a < an.size(); a++){
            ans.push_back(an[a]);
        }
        ok = 1;
        return;
    }
    if(i == 0 && sum == 0){
        for(int a = 0; a < an.size(); a++){
            ans.push_back(an[a]);
        }
        ok = 1;
        return;
    }
    if(dp[i - 1][sum]){
        get(arr, i - 1, sum, an);
    }
    if(sum >= arr[i] && dp[i - 1][sum - arr[i]]){
        an.push_back(i);
        get(arr, i - 1, sum - arr[i], an);
    }
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    n = w.size();
    for(int j = 0; j < n; j++){
        dp[j][w[j]];
        dp[j][0] = 1;
    }
    for(int i = 1; i < n; i++){
        for(int j = 0; j <= 1e4 + 1; j++){
            if(j >= w[i]){
                dp[i][j] = dp[i - 1][j - w[i]] || dp[i - 1][j];
            }
            else{
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    for(int i = l; i <= u; i++){
        if(dp[n - 1][i]){
            get(w, n - 1, i, ans);
            break;
        }
    }
    sort(ans.begin(), ans.end());
    return ans;
}

Compilation message

molecules.cpp: In function 'void get(std::vector<int>, int, int, std::vector<int>)':
molecules.cpp:15:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int a = 0; a < an.size(); a++){
      |                        ~~^~~~~~~~~~~
molecules.cpp:22:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int a = 0; a < an.size(); a++){
      |                        ~~^~~~~~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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