Submission #1104069

#TimeUsernameProblemLanguageResultExecution timeMemory
1104069asdfghjkDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms336 KiB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define ld long double
#define S second
using namespace std;
const ll N = 4e5 + 5;
const ll NN = 4e5 + 5;
const ll INF = 1e18;
const ll inf = 1e9;
const ll MOD = 1e9 + 7;
vector <int> find_subset(int l,int r,vector <int> a){
    vector <int> ans;
    ans.clear();
    int n = a.size();
    int sum = 0;
    for(int i = 0;i < n;i++){
        sum += a[i];
        ans.pb(i);
        if(sum >= l && sum <= r)break;
    }
    if(ans.size() == 0)ans.pb(0);
    return ans;
}
#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...