| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1056973 | mychecksedad | Radio Towers (IOI22_towers) | C++17 | 4072 ms | 6356 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 "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pi pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
struct Fenwick{
vector<int> t;
int n;
Fenwick(int n): n(n){
t.resize(n+1);
}
void add(int v){
while(v>0){
t[v]++;
v -= v&-v;
}
}
int get(int v){
int res = 0;
while(v <= n){
res += t[v];
v += v&-v;
}
return res;
}
};
void op(vector<int> &a, vector<int> &A, vector<int> &B){
if(a.size() <= 1){
A = a;
B.pb(0);
return;
}
A.pb(a[0]);
A.pb(a[1]);
B.pb(0);
B.pb(1);
for(int i = 2; i < a.size(); ++i){
if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){
A.pop_back();
B.pop_back();
A.pb(a[i]);
B.pb(i);
}else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){
A.pop_back();
B.pop_back();
A.pb(a[i]);
B.pb(i);
}else{
A.pb(a[i]);
B.pb(i);
}
}
}
int n;
vector<int> A, B, A2, A1, B1, B2, a;
Fenwick f(1000000);
void init(int nn, std::vector<int> aa) { n=nn;a=aa;
if(n == 1) return;
op(a, A, B);
// elimizde a b var cool
if(A[0] > A[1]){
for(int i = 0; i < A.size(); i += 2){
f.add(B[i]);
}
}else{
for(int i = 1; i < A.size(); i += 2){
f.add(B[i]);
}
}
}
int max_towers(int L, int R, int D) {
if(n == 1 || L == R) return 1;
return max(f.get(R-1) - f.get(L), 2);
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
