oj.uz

Submission #43006

# Submission time Handle Problem Language Result Execution time Memory
43006 2018-03-07T19:11:18 Z PowerOfNinjaGo Editor (BOI15_edi) C++14
20 / 100
 139 ms 98844 KB 
//Power Of Ninja Go
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vii vector< ii >
#define pb push_back
const int maxn = 5e3+5;
int par[maxn];
int cur[maxn];
int tmp[maxn];
int keep[maxn][maxn];
int num[maxn];
int main()
{
    //#ifndef atom freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif
    int n; cin >> n;
    for(int i = 1; i<= n; i++)
    {
        int x;
        cin >> x;
        if(x> 0)
        {
            if(i>= 3)
            {
                for(int j = 0; j<= n; j++) tmp[j] = keep[i-1][j];
            }
            num[i] = x;
            tmp[0] = i;
            for(int j = 0; j<= n; j++) cur[j] = keep[i][j] = tmp[j];
        }
        else
        {
            x *= -1;
            int fnd = 0;
            for(int j = x-1; j>= 0; j--)
            {
                if(cur[j])
                {
                    fnd = max(fnd, cur[j]);
                }
            }
            //printf("fnd is %d\n", fnd);
            memset(tmp, 0, sizeof tmp);
            if(fnd>= 2) for(int j = 0; j<= n; j++) tmp[j] = keep[fnd-1][j];
            tmp[x] = i;
            for(int j = 0; j<= n; j++) cur[j] = keep[i][j] = tmp[j];
        }
        //printf("i = %d: ", i);
        //for(int i = 0; i<= n; i++) printf("%d ", cur[i]);
        //printf("\n");
        printf("%d\n", num[cur[0]]);
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 131 ms 98408 KB Output is correct
3 Correct 2 ms 98408 KB Output is correct
4 Correct 1 ms 98408 KB Output is correct
5 Correct 135 ms 98572 KB Output is correct
6 Correct 2 ms 98572 KB Output is correct
7 Correct 124 ms 98708 KB Output is correct
8 Correct 1 ms 98708 KB Output is correct
9 Correct 139 ms 98844 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 98844 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 98844 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 131 ms 98408 KB Output is correct
3 Correct 2 ms 98408 KB Output is correct
4 Correct 1 ms 98408 KB Output is correct
5 Correct 135 ms 98572 KB Output is correct
6 Correct 2 ms 98572 KB Output is correct
7 Correct 124 ms 98708 KB Output is correct
8 Correct 1 ms 98708 KB Output is correct
9 Correct 139 ms 98844 KB Output is correct
10 Runtime error 3 ms 98844 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -