# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116992 | FutymyClone | San (COCI17_san) | C++14 | 250 ms | 27192 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 45;
const int maxn = 21e5 + 5;
int n, h[N], g[N], bit[maxn], cnt = 0;
long long k;
vector <pair <long long, int> > vec1, vec2;
vector <int> vec;
map <int, int> mm;
void update (int x) {
for (int i = x; i > 0; i -= i & -i) bit[i]++;
}
int query (int x) {
int ans = 0;
for (int i = x; i < maxn; i += i & -i) ans += bit[i];
return ans;
}
int main(){
scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++) scanf("%d %d", &h[i], &g[i]);
for (int mask = 0; mask < (1 << (n / 2)); mask++) {
long long total = 0;
int curh = 0;
bool ok = true;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |