제출 #40638

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
40638	2018-02-06 04:00:41	leejseo	Detecting Molecules (IOI16_molecules)	C++98	100 / 100	75 ms	35884 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 <bits/stdc++.h>
using namespace std;
typedef long long lld;
vector< pair<lld, lld> > L;
lld fr[200002];
lld bk[200002];
vector<int> find_subset(int l, int u, vector<int> w) {
    int N = w.size();
    for (int i=0; i<N; i++){
        L.push_back(make_pair(w[i], i));
    }
    sort(L.begin(), L.end());
    for (int i=0; i<N; i++){
        if (i == 0){
            fr[i] = L[i].first;
            bk[i] = L[N-i-1].first;
            continue;
        }
        else{
            fr[i] = fr[i-1] + L[i].first;
            bk[i] = bk[i-1] + L[N-i-1].first;
        }
    }
    vector<int> ans;
    for (int k=0; k<N; k++){
        if (fr[k] > u) break;
        if (fr[k] >= l && fr[k] <= u){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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