#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#pragma GCC optimize("Ofast")
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// Indexed Set
template <class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> void print(indexed_set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
struct segTree {
vector<int> tree;
int size = 1;
void init(int s) {
while(size < s) {
size *= 2;
}
tree.assign(2 * size - 1, 0);
}
void upd(int u, int value, int x, int lx, int rx) {
if(rx - lx == 1) {
tree[x] = value;
return;
}
int mid = (lx + rx) / 2;
if(u < mid) {
upd(u, value, 2 * x + 1, lx, mid);
} else {
upd(u, value, 2 * x + 2, mid, rx);
}
tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
}
void upd(int u, int value) {
upd(u, value, 0, 0, size);
}
int get(int l, int r, int x, int lx, int rx) {
if(lx >= r || rx <= l) {
return -1;
}
if(lx >= l && rx <= r) {
return tree[x];
}
int mid = (lx + rx) / 2;
int s1 = get(l, r, 2 * x + 1, lx, mid);
int s2 = get(l, r, 2 * x + 2, mid, rx);
return max(s1, s2);
}
int get(int l, int r) {
return get(l, r, 0, 0, size);
}
};
segTree seg;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
indexed_set<int> st;
for(int i = 0; i <= N; i++) {
st.insert(i);
}
for(int i = 0; i < C; i++) {
// [start:end]
int start = *st.find_by_order(S[i]);
int end = *st.find_by_order(E[i] + 1) - 1;
for(int j = S[i] + 1; j <= E[i]; j++) {
st.erase(st.find_by_order(S[i] + 1));
}
S[i] = start, E[i] = end;
}
seg.init(N + 2);
for(int i = 0; i < N - 1; i++) {
seg.upd(i, K[i]);
}
vector<int> p(N + 2);
for(int i = 0; i < C; i++) {
if(seg.get(S[i], E[i]) < R) {
p[S[i]]++;
p[E[i] + 1]--;
}
}
for(int i = 1; i <= N; i++) {
p[i] += p[i - 1];
}
return max_element(all(p)) - p.begin();
}
Compilation message
tournament.cpp: In function 'void setIO(std::string)':
tournament.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tournament.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
66 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tournament.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
70 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
tournament.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
304 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
304 KB |
Output is correct |
| 6 |
Correct |
1 ms |
312 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
304 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
6 ms |
572 KB |
Output is correct |
| 3 |
Correct |
4 ms |
464 KB |
Output is correct |
| 4 |
Correct |
5 ms |
596 KB |
Output is correct |
| 5 |
Correct |
7 ms |
568 KB |
Output is correct |
| 6 |
Correct |
5 ms |
628 KB |
Output is correct |
| 7 |
Correct |
5 ms |
596 KB |
Output is correct |
| 8 |
Correct |
5 ms |
596 KB |
Output is correct |
| 9 |
Correct |
3 ms |
468 KB |
Output is correct |
| 10 |
Correct |
5 ms |
572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
58 ms |
3724 KB |
Output is correct |
| 2 |
Correct |
120 ms |
6916 KB |
Output is correct |
| 3 |
Correct |
85 ms |
5964 KB |
Output is correct |
| 4 |
Correct |
138 ms |
6844 KB |
Output is correct |
| 5 |
Correct |
119 ms |
6708 KB |
Output is correct |
| 6 |
Correct |
143 ms |
6644 KB |
Output is correct |
| 7 |
Correct |
138 ms |
6844 KB |
Output is correct |
| 8 |
Correct |
124 ms |
6824 KB |
Output is correct |
| 9 |
Correct |
75 ms |
5952 KB |
Output is correct |
| 10 |
Correct |
94 ms |
6044 KB |
Output is correct |
