oj.uz

답안 #959169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959169 2024-04-07T14:33:34 Z Abito Broken Device (JOI17_broken_device) C++17
0 / 100
 31 ms 2800 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 28 ms 2396 KB Output is partially correct - L* = 17
2 Partially correct 27 ms 2800 KB Output is partially correct - L* = 16
3 Partially correct 28 ms 2384 KB Output is partially correct - L* = 18
4 Partially correct 30 ms 2496 KB Output is partially correct - L* = 16
5 Partially correct 26 ms 2568 KB Output is partially correct - L* = 17
6 Partially correct 26 ms 2404 KB Output is partially correct - L* = 15
7 Partially correct 26 ms 2544 KB Output is partially correct - L* = 18
8 Partially correct 31 ms 2400 KB Output is partially correct - L* = 18
9 Partially correct 26 ms 2392 KB Output is partially correct - L* = 18
10 Partially correct 27 ms 2404 KB Output is partially correct - L* = 16
11 Partially correct 27 ms 2368 KB Output is partially correct - L* = 17
12 Partially correct 26 ms 2496 KB Output is partially correct - L* = 21
13 Partially correct 26 ms 2596 KB Output is partially correct - L* = 18
14 Partially correct 26 ms 2560 KB Output is partially correct - L* = 18
15 Partially correct 26 ms 2404 KB Output is partially correct - L* = 16
16 Partially correct 26 ms 2396 KB Output is partially correct - L* = 17
17 Partially correct 27 ms 2396 KB Output is partially correct - L* = 17
18 Partially correct 26 ms 2396 KB Output is partially correct - L* = 16
19 Partially correct 26 ms 2476 KB Output is partially correct - L* = 18
20 Partially correct 26 ms 2404 KB Output is partially correct - L* = 16
21 Partially correct 27 ms 2400 KB Output is partially correct - L* = 17
22 Partially correct 28 ms 2656 KB Output is partially correct - L* = 17
23 Partially correct 26 ms 2388 KB Output isn't correct - L* = 0
24 Partially correct 30 ms 2372 KB Output is partially correct - L* = 17
25 Partially correct 26 ms 2372 KB Output is partially correct - L* = 21
26 Partially correct 26 ms 2392 KB Output is partially correct - L* = 16
27 Partially correct 28 ms 2488 KB Output is partially correct - L* = 15
28 Partially correct 30 ms 2392 KB Output is partially correct - L* = 16
29 Partially correct 26 ms 2492 KB Output is partially correct - L* = 16
30 Partially correct 28 ms 2392 KB Output is partially correct - L* = 21
31 Partially correct 26 ms 2396 KB Output is partially correct - L* = 17
32 Partially correct 27 ms 2396 KB Output is partially correct - L* = 18
33 Partially correct 30 ms 2444 KB Output is partially correct - L* = 18
34 Partially correct 31 ms 2532 KB Output is partially correct - L* = 19
35 Partially correct 26 ms 2476 KB Output is partially correct - L* = 15
36 Partially correct 28 ms 2640 KB Output is partially correct - L* = 15
37 Partially correct 27 ms 2436 KB Output is partially correct - L* = 16
38 Partially correct 27 ms 2392 KB Output is partially correct - L* = 18
39 Partially correct 26 ms 2476 KB Output is partially correct - L* = 17
40 Partially correct 26 ms 2404 KB Output is partially correct - L* = 17