제출 #1021934

#제출 시각아이디문제언어결과실행 시간메모리
1021934amirhoseinfar1385Detecting Molecules (IOI16_molecules)C++17
19 / 100
1 ms600 KiB
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10;
int n;
long long suma=0,mina=(1<<31),ps[maxn];

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    n=w.size();
    for(auto x:w){
        suma+=x;
        mina=min(mina,1ll*x);
    }
    if(l>suma||u<mina){
        return {};
    }
    for(int i=1;i<=n;i++){
        ps[i]=ps[i-1]+w[i-1];
    }
    for(int i=1;i<=n;i++){
        if((ps[i]>=l&&ps[i]<=u)||((ps[n]-ps[n-i])>=l&&(ps[n]-ps[n-i])<=u)||(ps[i]<l&&ps[n]-ps[n-i]>u)){
            for(int j=i;j<=n;j++){
                if(ps[j]-ps[j-i]>=l&&ps[j]-ps[j-i]<=u){
                    vector<int>ret;
                    for(int k=j-i+1;k<=j;k++){
                        ret.push_back(k-1);
                    }
                    return ret;
                }
            }
        }
    }
    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...