oj.uz

답안 #62933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62933 2018-07-31T00:22:19 Z Benq Editor (BOI15_edi) C++11
20 / 100
 3000 ms 1368 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 300001;

int N, lev[MX], pre[MX];
bitset<MX> act;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    FOR(i,1,N+1) {
        cin >> lev[i]; act[i] = 1; 
        if (lev[i] < 0) {
            FORd(j,1,i) if (lev[j] > lev[i] && act[j]) {
                pre[i] = j;
                break;
            }
            int cur = pre[i];
            while (cur) {
                act[cur] = act[cur]^1;
                cur = pre[cur];
            }
        }
        int des = 0;
        FORd(j,1,N+1) if (act[j] && lev[j] > 0) {
            des = lev[j];
            break;
        }
        cout << des << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 26 ms 624 KB Output is correct
3 Correct 3 ms 624 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 62 ms 628 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 26 ms 628 KB Output is correct
8 Correct 3 ms 772 KB Output is correct
9 Correct 24 ms 772 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3035 ms 1052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3062 ms 1368 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 26 ms 624 KB Output is correct
3 Correct 3 ms 624 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 62 ms 628 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 26 ms 628 KB Output is correct
8 Correct 3 ms 772 KB Output is correct
9 Correct 24 ms 772 KB Output is correct
10 Execution timed out 3035 ms 1052 KB Time limit exceeded
11 Halted 0 ms 0 KB -