oj.uz

답안 #959167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959167 2024-04-07T14:31:32 Z Abito Broken Device (JOI17_broken_device) C++17
0 / 100
 28 ms 3112 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
bool vis[155];
int t1=time(0);
void Anna( int n, long long X, int k, int p[] ){
    memset(vis,0,sizeof(vis));
    long long j=0;
    t1++;
    srand(t1);
    int x=rand()%2;
    //cout<<x<<endl;
    for (int i=0;i<k;i++) vis[p[i]]=1;
    if (x){
    for (int i=0;i<n;i+=2){
        if ((vis[i] && vis[i+1]) || j>=60LL){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        if ((X&(1LL<<j)) && vis[i+1]){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        if (X&(1LL<<j)){
            Set(i,0);
            Set(i+1,1);
            j++;
            continue;
        }
        if (!(X&(1LL<<j)) && vis[i]){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        Set(i,1);
        Set(i+1,0);
        j++;
    }return;}
    for (int i=0;i<n;i+=2){
        if ((vis[i] && vis[i+1]) || j>=60LL){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        if ((X&(1LL<<j)) && vis[i]){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        if (X&(1LL<<j)){
            Set(i,1);
            Set(i+1,0);
            j++;
            continue;
        }
        if (!(X&(1LL<<j)) && vis[i+1]){
            Set(i,0);
            Set(i+1,0);
            continue;
        }
        Set(i,0);
        Set(i+1,1);
        j++;
    }return;
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
int t2=time(0);
long long Bruno( int n, int a[] ){
    //for (int i=0;i<n;i++) cout<<a[i]<<' ';cout<<endl;
    t2++;
    srand(t2);
    int x=rand()%2;
    //cout<<x<<endl;
    long long X=0,j=0;
    if (x){
    for (int i=0;i<n;i+=2){
        if (!a[i] && !a[i+1]) continue;
        if (a[i+1]) X|=(1LL<<j);
        j++;
    }
    return X;}
    for (int i=0;i<n;i+=2){
        if (!a[i] && !a[i+1]) continue;
        if (a[i]) X|=(1LL<<j);
        j++;
    }return X;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2776 KB Output is partially correct - L* = 17
2 Partially correct 26 ms 2860 KB Output is partially correct - L* = 16
3 Partially correct 26 ms 2972 KB Output is partially correct - L* = 19
4 Partially correct 26 ms 2760 KB Output is partially correct - L* = 16
5 Partially correct 26 ms 2772 KB Output is partially correct - L* = 17
6 Partially correct 26 ms 2752 KB Output is partially correct - L* = 17
7 Partially correct 27 ms 2872 KB Output is partially correct - L* = 18
8 Partially correct 26 ms 2668 KB Output is partially correct - L* = 18
9 Partially correct 26 ms 2772 KB Output is partially correct - L* = 18
10 Partially correct 26 ms 2776 KB Output is partially correct - L* = 16
11 Partially correct 28 ms 2616 KB Output isn't correct - L* = 0
12 Partially correct 26 ms 2776 KB Output is partially correct - L* = 21
13 Partially correct 27 ms 2728 KB Output is partially correct - L* = 18
14 Partially correct 26 ms 2676 KB Output is partially correct - L* = 18
15 Partially correct 26 ms 2868 KB Output is partially correct - L* = 16
16 Partially correct 26 ms 2636 KB Output is partially correct - L* = 17
17 Partially correct 26 ms 2680 KB Output is partially correct - L* = 19
18 Partially correct 26 ms 2784 KB Output is partially correct - L* = 16
19 Partially correct 26 ms 2776 KB Output is partially correct - L* = 18
20 Partially correct 26 ms 2756 KB Output is partially correct - L* = 16
21 Partially correct 26 ms 2564 KB Output is partially correct - L* = 15
22 Partially correct 28 ms 2748 KB Output is partially correct - L* = 16
23 Partially correct 26 ms 2748 KB Output is partially correct - L* = 15
24 Partially correct 26 ms 2776 KB Output is partially correct - L* = 17
25 Partially correct 26 ms 2772 KB Output is partially correct - L* = 21
26 Partially correct 26 ms 2772 KB Output is partially correct - L* = 16
27 Partially correct 26 ms 2784 KB Output is partially correct - L* = 16
28 Partially correct 27 ms 2768 KB Output is partially correct - L* = 19
29 Partially correct 26 ms 2772 KB Output is partially correct - L* = 16
30 Partially correct 26 ms 2772 KB Output is partially correct - L* = 22
31 Partially correct 26 ms 2780 KB Output is partially correct - L* = 16
32 Partially correct 26 ms 2776 KB Output is partially correct - L* = 18
33 Partially correct 28 ms 2848 KB Output is partially correct - L* = 15
34 Partially correct 27 ms 2752 KB Output is partially correct - L* = 16
35 Partially correct 27 ms 3112 KB Output is partially correct - L* = 15
36 Partially correct 26 ms 2780 KB Output is partially correct - L* = 15
37 Partially correct 28 ms 2704 KB Output is partially correct - L* = 16
38 Partially correct 26 ms 2772 KB Output is partially correct - L* = 18
39 Partially correct 27 ms 2772 KB Output is partially correct - L* = 17
40 Partially correct 26 ms 2776 KB Output is partially correct - L* = 15