제출 #1115209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115209		Zflop	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	39 ms	65536 KiB

molecules

#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 2;

int dp[NMAX],from[NMAX];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    dp[0] = 1;
    for (int i = 0; i < u;++i) from[i] = -1;
    for (int i = 0; i < w.size();++i) {
        for (int j = u + 1; j >= 0;--j)
            if (dp[j]) {
                dp[j + w[i]] = 1;
                from[j] = i;
            }
    }
    vector<int>v;
    int este = 0;
    for (int i = u; i >= l;--i)
        if (dp[i]) {
            este = i;
            break;
        }
    v.push_back(este);
    while (from[v.back()] != -1) {
        v.push_back(from[v.back()]);
    }
    return v;
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (int i = 0; i < w.size();++i) {
      |                     ~~^~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31