제출 #20751

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
20751	2017-02-15 16:07:25	ainta	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	53 ms	5344 KiB

molecules

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "molecules.h"
#include <stdio.h>
#include <algorithm>
using namespace std;
struct point{
    int a, num;
    bool operator<(const point &p)const{
        return a<p.a;
    }
}P[201000];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int i, n = w.size(), j, k;
    long long S1 = 0, S2 = 0;
    for(i=0;i<n;i++)P[i].num=i,P[i].a=w[i];
    sort(P,P+n);
    vector<int>res;
    for(i=0;i<n;i++){
        S1 += P[i].a;
        S2 += P[n-i-1].a;
        if(S1 <= u && S2 >= l){
            if(S1 >= l){
                for(j=0;j<=i;j++)res.push_back(P[j].num);
                return res;
            }
            for(j=i+1;j<n;j++){
                S1 += P[j].a;
                S1 -= P[j-i-1].a;
                if(S1 >= l){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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