Submission #1152370

#TimeUsernameProblemLanguageResultExecution timeMemory
1152370EsgeerDetecting Molecules (IOI16_molecules)C++20
100 / 100
74 ms17576 KiB
#include "molecules.h" #include <bits/stdc++.h> #define int long long #pragma GCC optimize("O3") #define vi vector<int> #define vb vector<bool> #define F(i, s, e) for(int i = s; i < e; i++) #define sp <<' '<< #define pii pair<int, int> #define fi first #define se second #define pb push_back #define vvi vector<vi> #define vpi vector<pii> #define vvpi vector<vpi> #define endl '\n' const int mod = 1e9 + 7; using namespace std; const int N = 2e5+5; const int inf = 1e12; vector<int32_t> find_subset(int32_t L, int32_t R, vector<int32_t> b) { int n = b.size(); vpi a; F(i, 0, n) a.pb({b[i], i}); sort(a.begin(), a.end()); int smaller = -1; int curSum = 0; F(i, 0, n) { curSum += a[i].fi; if(curSum >= L) { if(curSum <= R) { vector<int32_t> res; F(j, 0, i+1) res.pb(a[j].se); return res; } break; } smaller = i; } if(smaller != -1) { set<pii> elements; int summy = 0; F(i, 0, smaller+1) { elements.insert(a[i]); summy += a[i].fi; } priority_queue<pii> pq; F(i, smaller+1, n) { pq.push(a[i]); } while(pq.size()) { pii nw = pq.top(); pii old = *elements.begin(); if(old.fi >= nw.fi) { break; // no need for more; } elements.erase(elements.begin()); elements.insert(nw);; pq.pop(); summy -= old.fi; summy += nw.fi; if(summy >= L) { vector<int32_t> res; for(pii el : elements) res.pb(el.se); return res; } if(summy > R) break; // exceeded the threshold, somehow :/ } } return vector<int32_t>(0); }

Compilation message (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
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...