oj.uz

답안 #959138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959138 2024-04-07T14:10:42 Z Kavelmydex Broken Device (JOI17_broken_device) C++17
0 / 100
 37 ms 3132 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()

const int N = 150, OO = 1e9, mod = 1e9+7, mx = 10;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}
const int dx[]{0,0,-1,1}, dy[]{1,-1,0,0};

int mp[N], ans[N];
void Anna( int n, long long X, int K, int P[] ){
  memset(mp,0,sizeof(mp)); memset(ans,0,sizeof(ans));
  For(i,K){
      mp[P[i]] = 1;
  }
  vi v;
  For(i,60){
    if((1LL<<i) & X){
        v.pb(i);
    }
  }
  for(int i=0; i<=89; ++i){
    bool ok = 1;
    for(int j=i; j<=i+60; ++j){
        ok &= (!mp[j]);
    }
    if(ok){
        ans[i] = 1;
        for(int x: v){
            assert(i+x+1 < N);
            ans[i+x+1] = 1;
        }
        break;
    }
  }
  For(i,n){
    Set(i,ans[i]);
  }
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()

long long Bruno( int N, int A[] ){
    int fi = 0;
    For(i,N){
        if(A[i]) {
            fi = i;
            break;
        }
    }
    ll ans = 0;
    for(int i=fi+1; i+59<N; ++i){
        if(A[i]){
            ans += (1LL<<(i-fi-1));
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

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