Submission #676850

#	Time	Username	Problem	Language	Result	Execution time	Memory
676850		coding_snorlax	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	300 KiB

molecules

#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> answer;
vector<int> find_subset(int l,int u,vector<int> w){
    answer.clear();
    long long int Min=0;
    long long int Max=0;
    int flag=-1;
    for(int i=0 ; i<(int)w.size();i++){
        Min += w[i];
        Max += w[(int)w.size()-i-1];
        if (Min <= u && Max >= l){
            flag = i;
            break;
        }
    }
    if(flag == -1) return answer;
    int Count = 0;

    while(!(Min >= l && Min<=u)){
        Min -= w[flag];
        Min += w[(int)w.size()-1-Count];
        answer.push_back((int)w.size()-1-Count);
        flag --;
        Count ++;
    }
    for(int i=0;i<=flag;i++){
        answer.push_back(i);
    }
    return answer;
}

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