oj.uz

Submission #52548

# Submission time Handle Problem Language Result Execution time Memory
52548 2018-06-26T07:04:40 Z 노영훈(#1364) Secret (JOI14_secret) C++11
6 / 100
 656 ms 8576 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int MX=1001, B=31;

int n, A[MX];

vector<int> P;

// p <= x < q, p < y <= q
int D[MX][MX]; // [x, y)
int sz;

void _fill(){
    for(int i=0; i<sz-1; i++){
        int p=P[i], q=P[i+1];
        for(int x=p; x<q; x++){
            D[x][x+1]=A[x];
            for(int y=x+2; y<=q; y++)
                D[x][y]=Secret(D[x][y-1], A[y-1]);
        }
    }
    for(int i=0; i<sz; i++){
        for(int j=i+2; j<sz; j++){
            int p=P[i], q=P[j];
            D[p][q]=Secret(D[p][q-B], D[q-B][q]);
        }
    }
    /*
    cout<<"\nD: \n";
    for(int i=0; i<n; i++){
        for(int j=1; j<=n; j++){
            cout<<D[i][j]<<' ';
        }
        cout<<'\n';
    }
    */
}

void Init(int N, int _A[]) {
    n=N;
    for(int i=0; i<n; i++) A[i]=_A[i];
    for(int p=0; p<n; p+=B) P.push_back(p);
    P.push_back(n);
    sz=P.size();

    _fill();
}

int Query(int L, int R) {
    int l=L, r=R+1;
    int a=-1,b=-1;
    for(int i=0; i<sz; i++) if(l<P[i]){ a=P[i]; break; }
    for(int i=sz-1; i>=0; i--) if(P[i]<r){ b=P[i]; break; }
    if(b<a) return D[l][r];
    if(a==b) return Secret(D[l][a], D[b][r]);
    else return Secret(Secret(D[l][a], D[a][b]), D[b][r]);

}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 178 ms 4436 KB Output is partially correct - number of calls to Secret by Init = 7681, maximum number of calls to Secret by Query = 2
2 Partially correct 191 ms 4584 KB Output is partially correct - number of calls to Secret by Init = 7696, maximum number of calls to Secret by Query = 2
3 Partially correct 192 ms 4672 KB Output is partially correct - number of calls to Secret by Init = 7712, maximum number of calls to Secret by Query = 2
4 Incorrect 635 ms 8476 KB Output isn't correct - number of calls to Secret by Init = 15429, maximum number of calls to Secret by Query = 2
5 Incorrect 596 ms 8476 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 2
6 Incorrect 576 ms 8476 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 1
7 Incorrect 656 ms 8476 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 2
8 Incorrect 607 ms 8572 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 2
9 Incorrect 642 ms 8576 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 2
10 Incorrect 653 ms 8576 KB Output isn't correct - number of calls to Secret by Init = 15436, maximum number of calls to Secret by Query = 2