제출 #417918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417918		Odavey	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	56 ms	4904 KiB

molecules

//
// ~oisín~ C++ Template
//

#include                <bits/stdc++.h>
#define MX_N            5001
#define mp              make_pair
#define mod7            1000000007
#define modpi           314159
#define PI              3.141592653589793238
#define pb              push_back
#define FastIO          ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define All(a)          a.begin(),a.end()
#define fi              first
#define se              second
#define ll              long long int
#define ull             unsigned long long int

int kx[8]  =            {+2, +2, -2, -2, +1, +1, -1, -1};
int ky[8]  =            {+1, -1, +1, -1, +2, -2, +2, -2};
int d9x[9] =            {+1, +1, +1, +0, +0, +0, -1, -1, -1};
int d9y[9] =            {+1, +0, -1, +1, +0, -1, +1, +0, -1};
int dx4[4] =            {+0, +0, +1, -1};
int dy4[4] =            {+1, -1, +0, +0};

ll gcd(ull a, ull b){
    return (a==0)?b:gcd(b%a,a);
}

ll lcm(ull a, ull b){
    return a*(b/gcd(a,b));
}

const long long INF = 1e18;

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w){
    int n = w.size();
    pair<int, int> a[n];
    for(int i=0;i<n;++i){
        a[i] = {w[i], i};
    }
    sort(a, a+n);
    int L = 0;
    int R = 0;
    int run = a[0].fi;
    vector<int> ans;
    while(L <= R){
        if(run < l){
            ++R;
            if(R == n){
                return ans;
            }
            run += a[R].fi;
        }else if(run > u){
            run -= a[L].fi;
            ++L;
        }else{
            for(int i=L;i<=R;++i){
                ans.pb(a[i].se);
            }
            return ans;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^

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