oj.uz

답안 #61043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61043 2018-07-25T06:43:30 Z 노영훈(#1760) Broken Device (JOI17_broken_device) C++11
0 / 100
 7 ms 1312 KB 
#include "Annalib.h"
#include <vector>
#include <iostream>
using namespace std;
typedef long long ll;

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

    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]) { Set(i, 0); continue; }
        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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 760 KB Wrong Answer [3]
2 Incorrect 6 ms 996 KB Wrong Answer [3]
3 Incorrect 4 ms 1164 KB Wrong Answer [3]
4 Incorrect 4 ms 1248 KB Wrong Answer [3]
5 Incorrect 5 ms 1248 KB Wrong Answer [3]
6 Incorrect 5 ms 1248 KB Wrong Answer [3]
7 Incorrect 6 ms 1248 KB Wrong Answer [3]
8 Incorrect 4 ms 1280 KB Wrong Answer [3]
9 Incorrect 5 ms 1296 KB Wrong Answer [3]
10 Incorrect 6 ms 1296 KB Wrong Answer [3]
11 Incorrect 6 ms 1296 KB Wrong Answer [3]
12 Incorrect 4 ms 1296 KB Wrong Answer [3]
13 Incorrect 6 ms 1296 KB Wrong Answer [3]
14 Incorrect 5 ms 1296 KB Wrong Answer [3]
15 Incorrect 6 ms 1296 KB Wrong Answer [3]
16 Incorrect 4 ms 1296 KB Wrong Answer [3]
17 Incorrect 4 ms 1296 KB Wrong Answer [3]
18 Incorrect 6 ms 1296 KB Wrong Answer [3]
19 Incorrect 5 ms 1296 KB Wrong Answer [3]
20 Incorrect 5 ms 1296 KB Wrong Answer [3]
21 Incorrect 5 ms 1296 KB Wrong Answer [3]
22 Incorrect 2 ms 1296 KB Wrong Answer [3]
23 Incorrect 6 ms 1296 KB Wrong Answer [3]
24 Incorrect 5 ms 1296 KB Wrong Answer [3]
25 Incorrect 5 ms 1296 KB Wrong Answer [3]
26 Incorrect 5 ms 1296 KB Wrong Answer [3]
27 Incorrect 5 ms 1296 KB Wrong Answer [3]
28 Incorrect 6 ms 1296 KB Wrong Answer [3]
29 Incorrect 5 ms 1296 KB Wrong Answer [3]
30 Incorrect 4 ms 1296 KB Wrong Answer [3]
31 Incorrect 6 ms 1296 KB Wrong Answer [3]
32 Incorrect 5 ms 1296 KB Wrong Answer [3]
33 Incorrect 5 ms 1296 KB Wrong Answer [3]
34 Incorrect 6 ms 1296 KB Wrong Answer [3]
35 Incorrect 5 ms 1296 KB Wrong Answer [3]
36 Incorrect 6 ms 1296 KB Wrong Answer [3]
37 Incorrect 5 ms 1296 KB Wrong Answer [3]
38 Incorrect 5 ms 1296 KB Wrong Answer [3]
39 Incorrect 6 ms 1296 KB Wrong Answer [3]
40 Incorrect 7 ms 1312 KB Wrong Answer [3]