제출 #1280104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280104		cnastea	Detecting Molecules (IOI16_molecules)	C++20	10 / 100	1096 ms	352 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second

vector<int> find_subset(int l, int r, vector<int> w){
    int n = w.size(); vector<int> x;
    vector<pair<int, int>> a(n); for(int i = 0; i < n; i++) a[i] = {w[i], i};
    sort(a.begin(), a.end());
    long long p = a[0].f, q = 0, c = 0, k;
    for(int i = 1; i < n; i++){
        if(p > r && q < l) {c = 1; break;}
        p += a[i].f; q += a[n-i].f;
    }
    if(n > 1) p += a[n-1].f; if(p < l) c = 1;
    if(c) return x;
    set<int> s; p = 0; q = n-1;
    for(int i = 0; i < n; i++){
        p += a[i].f; if(p > r) {p -= a[i].f; break;}
        s.insert(i);
    }
    if(p >= l) {
        int m = s.size();
        for(int i = 0; i < m; i++) {x.push_back(a[*s.begin()].s); s.erase(s.begin());}
        return x;
    }
    for(int i = 0; i < n; i++){
        p -= a[*s.begin()].f;
        s.erase(s.begin()); s.insert(q);
        p += a[q].f; q--;
        if(p >= l) break;
    }
    int m = s.size();
    for(int i = 0; i < m; i++) {x.push_back(a[*s.begin()].s); s.erase(s.begin());}
    return x;
}

컴파일 시 표준 에러 (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: 0 / 9
• Subtask 2: 10 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31