#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;
int n;
int a[mxn];
void sub1(){
bool ok[n];
memset(ok, false, sizeof(ok));
int ans = -1;
int pr[n];
memset(pr, -1, sizeof(pr));
fr(i, 0, n){
ok[i] = true;
if(a[i] > 0){
ans = i;
}
else{
int pos = i;
for(int j = i-1; j >= 0; j --){
if(!ok[j]) continue;
if(a[j] > 0){
pr[pos] = j;
ok[j] = false;
break;
}
else if(a[j] > a[pos]){
pr[pos] = j;
ok[j] = false;
if(pr[j] == -1){
break;
}
else{
pos = pr[j];
pr[j] = -1;
ok[pos] = true;
j = pos;
if(a[pos] >0) break;
}
}
}
}
ans = i;
while(ans >= 0 && (!ok[ans] || a[ans] < 0)){
--ans;
}
if(ans == -1){
cout<<0<<endl;
}
else{
cout<<a[ans] << endl;
}
}
}
void sub2(){
int pr[n];
memset(pr, -1, sizeof(pr));
int ans = -1;
fr(i, 0, n){
if(a[i] < 0){
if(ans != -1){
ans = pr[ans];
}
}
else{
pr[i] = ans;
ans = i;
}
if(ans == -1) cout<<0<<endl;
else cout<<a[ans]<<endl;
}
}
int bit[mxn];
void update(int k, int val){
while(k < mxn){
bit[k] += val;
k += k&-k;
}
}
int sum(int k){
int s = 0;
while(k > 0){
s += bit[k];
k -= k&-k;
}
return s;
}
int f(int p){
int cnt = sum(p);
int temp = 0;
for(int i = 20; i >= 0; i --){
if((1<<i) + temp < p){
if(bit[temp+(1<<i)] < cnt){
temp += (1<<i);
cnt -= bit[temp];
}
}
}
if(temp == 0){
if(bit[1]) return 1;
else return 0;
}
return temp+1;
}
vector<int> pos[mxn];
bool ok[mxn];
void sub3(){
fr(i, 0, n){
ok[i+1] = true;
if(a[i] < 0){
pos[-a[i]].pb(i+1);
}
update(i+1, 1);
}
for(int i = n; i >= 1; i --){
for(auto u : pos[i]) if(ok[u]) update(u, -1);
for(auto u : pos[i]){
if(!ok[u]) continue;
int ps = f(u);
if(ps != 0){
ok[ps] = false;
update(ps, -1);
}
}
}
fr(i, 0, n-1) cout<<0<<endl;
cout<<a[f(n+1)-1]<<endl;
}
void solve(){
cin >> n;
bool subtask1 = n<=5000;
bool subtask2 = true;
fr(i, 0, n){
cin >> a[i];
if(a[i] < -1) subtask2 = false;
}
if(subtask1){
sub1();
}
else if(subtask2){
sub2();
}
else{
sub3();
}
}
int main(){
freopen("edi3a.in","r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
Compilation message
edi.cpp: In function 'int main()':
edi.cpp:193:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("edi3a.in","r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
12160 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
12160 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
12160 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
12160 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |