Submission #1020450

#TimeUsernameProblemLanguageResultExecution timeMemory
1020450vjudge1Detecting Molecules (IOI16_molecules)C++17
19 / 100
1 ms348 KiB
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const int maxn = 2e5+12;

ll pref[maxn];
int n;

vector<int> find_subset(int L, int R, vector<int> w){
    n = w.size();
    for(int i=1;i<=n;i++){
        pref[i] = pref[i-1] + w[i-1];
    }
    for(int l=1;l<=n;l++){
        for(int r=l;r<=n;r++){
            if(pref[r] - pref[l-1] >= L && pref[r] - pref[l-1] <= R){
                vector<int> ans;
                for(int i=l;i<=r;i++){
                    ans.push_back(i-1);
                }
                return ans;
            }
        }
    }
    return {};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...