oj.uz

Submission #702241

# Submission time Handle Problem Language Result Execution time Memory
702241 2023-02-23T11:17:35 Z LittleCube Editor (BOI15_edi) C++14
35 / 100
 47 ms 3660 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int n, a[5005], undo[5005], active[5005];
set<pii> st;

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    active[0] = 1;
    cin >> n;
    if (n <= 5000)
    {
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            active[i] = 1;
            if (a[i] < 0)
            {
                int cur = i;
                for (int j = i - 1; j >= 1; j--)
                    if (active[j] && min(0, a[j]) > a[cur])
                    {
                        // cerr << cur << " undo " << j << '\n';
                        undo[cur] = j;
                        active[j] ^= 1;
                        cur = j;
                        if (!undo[cur])
                            break;
                        // cerr << cur << " redo " << undo[cur] << '\n';
                        active[undo[cur]] ^= 1;
                        cur = undo[cur];
                    }
            }
            for (int j = i; j >= 0; j--)
                if (active[j] && a[j] >= 0)
                {
                    cout << a[j] << '\n';
                    break;
                }
        }
    }
    else
    {
        vector<int> v = {0};
        for (int i = 1; i <= n; i++)
        {
            int a;
            cin >> a;
            if(a > 0)
                v.emplace_back(a);
            else
                v.pop_back();
            cout << v.back() << '\n';
        }
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 24 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 34 ms 400 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 400 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 6 ms 336 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2320 KB Output is correct
2 Correct 47 ms 3660 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 24 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 34 ms 400 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 400 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 6 ms 336 KB Output is correct
10 Correct 47 ms 2320 KB Output is correct
11 Correct 47 ms 3660 KB Output is correct
12 Incorrect 24 ms 1728 KB Output isn't correct
13 Halted 0 ms 0 KB -