#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
struct Node{
Node *lnode = nullptr, *rnode;
bool val = 0; // index
void update(int lo, int hi, int l, int r){
if(r <= lo || hi <= l) return;
if(r <= hi && lo <= l){
val = 1;
return;
}
push();
int mid = (l+r) / 2;
lnode->update(lo, hi, l, mid);
rnode->update(lo, hi, mid, r);
val = lnode->val|rnode->val;
}
int query(int lo, int hi, int l, int r){
if(r <= lo || hi <= l || !val) return 0;
if(r-l == 1){
val = 0;
return l+1;
}
push();
int mid = (l+r) / 2;
int res = 0;
res = lnode->query(lo, hi, l, mid);
if(!res) res = rnode->query(lo, hi, mid, r);
val = lnode->val|rnode->val;
return res;
}
void push(){
if(lnode == nullptr){
lnode = new Node();
rnode = new Node();
}
}
};
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
int n, val;
cin >> n;
vector<Node> v(1000001);
fo(i, n) {
cin >> val;
v[val].update(i, i+1, 0, 2e6);
}
int ans = 0;
for(int j = 1e6; j>= 0 ; j--){
while(v[j].val){
int pos = 0;
int h = j;
ans++;
while(h){
pos = v[h].query(pos, 2e6, 0, 2e6);
if(!pos) break;
h--;
}
}
}
cout << ans << "\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
24924 KB |
Output is correct |
| 2 |
Correct |
8 ms |
25688 KB |
Output is correct |
| 3 |
Correct |
10 ms |
26972 KB |
Output is correct |
| 4 |
Correct |
11 ms |
27484 KB |
Output is correct |
| 5 |
Runtime error |
141 ms |
131072 KB |
Execution killed with signal 9 |
| 6 |
Runtime error |
142 ms |
131072 KB |
Execution killed with signal 9 |
| 7 |
Runtime error |
145 ms |
131072 KB |
Execution killed with signal 9 |
| 8 |
Runtime error |
142 ms |
131072 KB |
Execution killed with signal 9 |
| 9 |
Runtime error |
155 ms |
131072 KB |
Execution killed with signal 9 |
| 10 |
Runtime error |
147 ms |
131072 KB |
Execution killed with signal 9 |
