oj.uz

Submission #61048

# Submission time Handle Problem Language Result Execution time Memory
61048 2018-07-25T06:47:21 Z 노영훈(#1760) Broken Device (JOI17_broken_device) C++11
0 / 100
 89 ms 3824 KB 
#include "Annalib.h"
#include <vector>
#include <iostream>
#include <assert.h>
using namespace std;
typedef long long ll;

static int N;

void my_set(int pos, int val){
    assert(0<=pos && pos<=N-1);
    if(val!=0 && val!=1) val=0;
    Set(pos, val);
}

void Anna(int _N, ll X, int K, int P[]){
    N=_N;

    ll F[100]={}, S[100]={};
    F[0]=1, F[1]=2, S[0]=1;
    for(int i=2; i<=85; i++) F[i]=F[i-1]+F[i-2];
    for(int i=1; i<=85; i++) S[i]=S[i-1]+F[i];

    bool out[150]={};
    for(int i=0; i<K; i++) out[P[i]]=true;
    for(int i=0; i<N/2; i++) if(out[i*2] || out[i*2+1]) out[i*2]=out[i*2+1]=true;

    int Y[100]={}; ll Z=X;
    for(int i=84; i>=0; i--){
        if(S[i]<Z) Y[i+1]=1, Z-=F[i+1];
    }
    if(Z!=0) Y[0]=1;

    // cout<<X<<": \n";
    // for(int i=0; i<86; i++) cout<<Y[i];
    // cout<<'\n';

    for(int i=0, j=0; i<N; i++){
        if(out[i]) { my_set(i, 0); continue; }
        my_set(i, Y[j++]);
    }
}

#include "Brunolib.h"
#include <vector>
using namespace std;
typedef long long ll;

ll Bruno(int N, int A[]){

    ll F[100]={}, S[100]={};
    F[0]=1, F[1]=2, S[0]=1;
    for(int i=2; i<=86; i++) F[i]=F[i-1]+F[i-2];
    for(int i=1; i<=86; i++) S[i]=S[i-1]+F[i];

    bool out[150]={};
    for(int i=0; i<N/2; i++) if(A[i*2]==0 || A[i*2+1]==0) out[i*2]=out[i*2+1]=true;
    
    int Y[150]={}; ll Z=0;
    for(int i=0, j=0; i<N; i++){
        if(out[i]) continue;
        Y[j++]=A[i];
    }

    for(int i=85; i>=0; i--){
        Z+=Y[i]*F[i];
    }
    return Z;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 2800 KB Output isn't correct - L* = 0
2 Incorrect 61 ms 3376 KB Output isn't correct - L* = 0
3 Incorrect 63 ms 3376 KB Output isn't correct - L* = 0
4 Incorrect 82 ms 3480 KB Output isn't correct - L* = 0
5 Incorrect 63 ms 3504 KB Output isn't correct - L* = 0
6 Incorrect 63 ms 3704 KB Output isn't correct - L* = 0
7 Incorrect 78 ms 3704 KB Output isn't correct - L* = 0
8 Incorrect 53 ms 3792 KB Output isn't correct - L* = 0
9 Incorrect 53 ms 3792 KB Output isn't correct - L* = 0
10 Incorrect 51 ms 3824 KB Output isn't correct - L* = 0
11 Incorrect 48 ms 3824 KB Output isn't correct - L* = 0
12 Incorrect 57 ms 3824 KB Output isn't correct - L* = 0
13 Incorrect 67 ms 3824 KB Output isn't correct - L* = 0
14 Incorrect 51 ms 3824 KB Output isn't correct - L* = 0
15 Incorrect 67 ms 3824 KB Output isn't correct - L* = 0
16 Incorrect 60 ms 3824 KB Output isn't correct - L* = 0
17 Incorrect 48 ms 3824 KB Output isn't correct - L* = 0
18 Incorrect 72 ms 3824 KB Output isn't correct - L* = 0
19 Incorrect 45 ms 3824 KB Output isn't correct - L* = 0
20 Incorrect 71 ms 3824 KB Output isn't correct - L* = 0
21 Incorrect 52 ms 3824 KB Output isn't correct - L* = 0
22 Incorrect 67 ms 3824 KB Output isn't correct - L* = 0
23 Incorrect 89 ms 3824 KB Output isn't correct - L* = 0
24 Incorrect 69 ms 3824 KB Output isn't correct - L* = 0
25 Incorrect 51 ms 3824 KB Output isn't correct - L* = 0
26 Incorrect 63 ms 3824 KB Output isn't correct - L* = 0
27 Incorrect 62 ms 3824 KB Output isn't correct - L* = 0
28 Incorrect 79 ms 3824 KB Output isn't correct - L* = 0
29 Incorrect 66 ms 3824 KB Output isn't correct - L* = 0
30 Incorrect 68 ms 3824 KB Output isn't correct - L* = 0
31 Incorrect 64 ms 3824 KB Output isn't correct - L* = 0
32 Incorrect 54 ms 3824 KB Output isn't correct - L* = 0
33 Incorrect 48 ms 3824 KB Output isn't correct - L* = 0
34 Incorrect 44 ms 3824 KB Output isn't correct - L* = 0
35 Incorrect 56 ms 3824 KB Output isn't correct - L* = 0
36 Incorrect 53 ms 3824 KB Output isn't correct - L* = 0
37 Incorrect 50 ms 3824 KB Output isn't correct - L* = 0
38 Incorrect 49 ms 3824 KB Output isn't correct - L* = 0
39 Incorrect 55 ms 3824 KB Output isn't correct - L* = 0
40 Incorrect 69 ms 3824 KB Output isn't correct - L* = 0