Submission #1177987

#TimeUsernameProblemLanguageResultExecution timeMemory
1177987batman3747Detecting Molecules (IOI16_molecules)C++20
0 / 100
1095 ms320 KiB
#include "bits/stdc++.h" #define all(x) (x).begin(), (x).end() #define debug(x) cerr << (#x) << " " << (x) << endl #define SZ(s) ((int)s.size()) #define pb push_back #define ff first #define ss second using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; vi find_subset(int s, int e, vi w){ int n = sizeof(w); map<int, vi> mp; for(int i = 0; i < n; i ++){ mp[w[i]].pb(i); } sort(all(w)); vi pref(n + 1); for(int i = 1; i <= n; i ++) pref[i] = pref[i - 1] + w[i - 1]; int l = 1, r = n; vi ans; while(l <= r){ int m = (l + r) / 2; int s1 = pref[m] - pref[l - 1], s2 = pref[r] - pref[m]; if(s1 >= s && s1 <= e){ for(int i = l - 1; i < m; i ++){ ans.pb(mp[w[i]].back()); mp[w[i]].pop_back(); } break; } if(s2 >= s && s2 <= e){ for(int i = m; i < r; i ++){ ans.pb(mp[w[i]].back()); mp[w[i]].pop_back(); } break; } if(s1 < s) l = m + 1; else if(s2 > e) r = m - 1; } sort(all(ans)); for(int &x : ans) x ++; return ans; }

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...