제출 #1134218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134218		TroySer	Detecting Molecules (IOI16_molecules)	C++20	0 / 100	0 ms	320 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

bool hasResponse = false;

vector<int> solution(int currInd, int currSum, vector<int> &currArray, int u, int l, int n, vector<int> &w, vector<vector<int> > &memo) {

    if (hasResponse) {
        return vector<int>(0);
    }

    if (currSum > u) {
        return vector<int>(0);
    }

    if (currInd == n && l <= currSum && currSum <= u) {
        hasResponse = true;
        return currArray;
    } else if (currInd == n) {
        return vector<int>(0);
    }

    if (0 <= currInd && currInd < n) {
        if (memo[currInd][currSum] == 0) {
            return vector<int>(0);
        }
    }

    // cout << currInd << " " << currSum << endl;

    if (0 <= currInd && currInd < n) {
        currSum += w[currInd];
    }

    for (int ind = currInd + 1; ind <= n; ind++) {

        if (ind != n)
            currArray.push_back(ind + 1);

        vector<int> currResponse = solution(ind, currSum, currArray, u, l, n, w, memo);

        if (currResponse.size() != 0) {
            hasResponse = true;
            return currResponse;
        }

        currArray.pop_back();

    }

    memo[currInd][currSum] = 0;
    return vector<int>(0);
}

vector<int> find_subset(int l, int u, vector<int> w) {

    int n = w.size();

    vector<int> arr;
    vector<vector<int> > memo;
    memo.resize(n, vector<int>(u + 1, -1));

    return solution(-1, 0, arr, u, l, n, w, memo);

}

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

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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