oj.uz

답안 #990915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990915 2024-05-31T19:29:04 Z MarwenElarbi Broken Device (JOI17_broken_device) C++17
0 / 100
 26 ms 2872 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
    int tab[N];
    memset(tab,0,sizeof tab);
    for (int i = 0; i < K; ++i)
    {
        tab[P[i]]=-1;
    }
    int convert[60];
    long long a[60];
    a[0]=1;
    for (int i = 1; i < 60; ++i)
    {
        a[i]=a[i-1]*2;
    }
    long long y=59;
    while(y--){
        if(X>=a[y]){
            X-=a[y];
            convert[y]=1;
        }else convert[y]=0;
    }
    int lst=0;
    for (int i = 0; i < N; i+=2)
    {
        if(convert[lst]==1){
            if (tab[i]!=-1&&tab[i+1]!=-1)
            {
                tab[i]=1;
                tab[i+1]=1;
                lst++;
            }
        }else{
            if (tab[i]!=-1)
            {
                tab[i]=1;
                tab[i+1]=0;
                lst++;
            }else if(tab[i+1]!=-1){
                tab[i]=0;
                tab[i+1]=1;
                lst++;
            }
        }
    }
    for (int i = 0; i < N; ++i)
    {
        if(tab[i]==1) Set(i,1);
        else Set(i,0);
    }
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
    int lst=0;
    long long x=0;
    long long a[60];
    a[0]=1;
    for (int i = 1; i < 60; ++i)
    {
        a[i]=a[i-1]*2;
        //cout <<a[i]<<endl;
    }
    for (int i = 0; i < N; i+=2)
    {
        if(lst>60) break;
        if(A[i]==1&&A[i+1]==1){
            x+=a[lst];
            lst++;
        }else if(A[i]==1||A[i+1]==1){
            lst++;
        }
    }
    //cout <<x<<endl;
    return x;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2752 KB Output isn't correct - L* = 0
2 Partially correct 23 ms 2788 KB Output isn't correct - L* = 0
3 Partially correct 23 ms 2768 KB Output isn't correct - L* = 0
4 Partially correct 23 ms 2748 KB Output isn't correct - L* = 0
5 Partially correct 22 ms 2772 KB Output isn't correct - L* = 0
6 Partially correct 22 ms 2752 KB Output isn't correct - L* = 0
7 Partially correct 22 ms 2796 KB Output isn't correct - L* = 0
8 Partially correct 23 ms 2768 KB Output isn't correct - L* = 0
9 Partially correct 23 ms 2752 KB Output isn't correct - L* = 0
10 Partially correct 24 ms 2772 KB Output isn't correct - L* = 0
11 Partially correct 24 ms 2688 KB Output isn't correct - L* = 0
12 Partially correct 23 ms 2860 KB Output isn't correct - L* = 0
13 Partially correct 23 ms 2748 KB Output isn't correct - L* = 0
14 Partially correct 22 ms 2768 KB Output isn't correct - L* = 0
15 Partially correct 20 ms 2872 KB Output isn't correct - L* = 0
16 Partially correct 23 ms 2776 KB Output isn't correct - L* = 0
17 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
18 Partially correct 24 ms 2684 KB Output isn't correct - L* = 0
19 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
20 Partially correct 24 ms 2780 KB Output isn't correct - L* = 0
21 Partially correct 20 ms 2724 KB Output isn't correct - L* = 0
22 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
23 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
24 Partially correct 20 ms 2752 KB Output isn't correct - L* = 0
25 Partially correct 24 ms 2780 KB Output isn't correct - L* = 0
26 Partially correct 20 ms 2752 KB Output isn't correct - L* = 0
27 Partially correct 25 ms 2772 KB Output isn't correct - L* = 0
28 Partially correct 20 ms 2780 KB Output isn't correct - L* = 0
29 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
30 Partially correct 22 ms 2772 KB Output isn't correct - L* = 0
31 Partially correct 23 ms 2768 KB Output isn't correct - L* = 0
32 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
33 Partially correct 24 ms 2808 KB Output isn't correct - L* = 0
34 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
35 Partially correct 23 ms 2776 KB Output isn't correct - L* = 0
36 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
37 Partially correct 24 ms 2780 KB Output isn't correct - L* = 0
38 Partially correct 24 ms 2760 KB Output isn't correct - L* = 0
39 Partially correct 23 ms 2764 KB Output isn't correct - L* = 0
40 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0