제출 #1172192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172192		h1440	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	0 ms	328 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fore(i,a,b) for(lli i = (a), abcdxd = (b); i < abcdxd; i++)
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ENDL '\n'
#define sz(s) lli((s).size())
#define pb push_back
using namespace std;
typedef int lli;
// typedef long long LLI;
typedef pair<lli, lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
typedef long double ld;
#define deb(x) cout << #x << ": " << x << endl;
#define BIGLLI __int128

std::vector<int> find_subset(int l, int r, std::vector<int> w) {
    lli n = sz(w);
    vii v(n); fore(i,0,n){
        v[i].f = w[i];
        v[i].s = i;
    }
    sort(rall(v));
    vi ans;
    vi sans = {v[n-1].s};
    lli sum = 0;
    if (l <= (sum + v[n-1].f) and (sum + v[n-1].f) <= r) return sans;
    fore(i,0,n-1){
        sum += v[i].f;
        ans.pb(v[i].s);
        sans.pb(v[i].s);
        if (l <= sum && sum <= r) return ans;
        if (l <= (sum + v[n-1].f) and (sum + v[n-1].f) <= r) return sans;
    }
    return {};
}

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

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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