oj.uz

답안 #954938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954938 2024-03-28T21:20:12 Z logangd Broken Device (JOI17_broken_device) C++14
8 / 100
 30 ms 2752 KB 
#include <bits/stdc++.h>
#include "Annalib.h"
typedef long long ll;
using namespace std;
void Anna( int N, ll X, int K, int P[] ){
  int ar[N]={0},s[60]={0};
  for(int i=0;i<60;i++)
    if(X&((ll)1<<i))s[i]=1;
  for(int i=0;i<N;i++)ar[i]=-1;
  for(int i=0;i<K;i++)ar[P[i]]=0;
  int curr=0;
  for(int i=0;i<N;i++){
    if(s[curr]==0){
      if(1<i&&ar[i-2]==1&&ar[i-1]!=1&&ar[i]!=1)continue;
      if(ar[i]!=0&&ar[i+2]!=0){
        ar[i]=ar[i+2]=1;
        ar[i+1]=0;
        curr++;
        i++;
      }
    }else{
      if(ar[i]!=-1)continue;
      if(i==0||ar[i-1]==1)ar[i]=1,curr++;
      else if(1<i&&ar[i-2]!=1)ar[i]=1,curr++;
    }
    if(59<curr)break;
  }
  //for(int i=0;i<60;i++)cout<<s[i];
  //cout<<endl;
  for(int i=0;i<N;i++){
    //if(ar[i]==1)cout<<1;
    //else cout<<0;
    if(ar[i]==1)Set(i,1);
    else Set(i,0);
  }
  //cout<<endl;
}
#include <bits/stdc++.h>
#include "Brunolib.h"
typedef long long ll;
using namespace std;
ll Bruno(int N, int A[]){
    ll ans=0, curr=0;
    for(int i=0;i<N;i++){
        if(curr>59)break;
        if(i<N-2&&A[i]==1&&A[i+1]==0&&A[i+2]==1){  
            //cout<<0; 
            curr++,i++;
        }else if(A[i]==1&&(i<2||(A[i-1]!=0||A[i-2]!=1))){
            ans|=((ll)1<<curr),curr++;
            //cout<<1;
        }
    }
    //cout<<endl<<ans<<endl;
    return ans;
}

Subtask #1
8.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 27 ms 2304 KB Output is partially correct - L* = 19
2 Partially correct 26 ms 2308 KB Output is partially correct - L* = 22
3 Partially correct 27 ms 2752 KB Output is partially correct - L* = 19
4 Partially correct 27 ms 2372 KB Output is partially correct - L* = 23
5 Partially correct 27 ms 2368 KB Output is partially correct - L* = 18
6 Partially correct 27 ms 2372 KB Output is partially correct - L* = 14
7 Partially correct 27 ms 2396 KB Output is partially correct - L* = 20
8 Partially correct 27 ms 2400 KB Output is partially correct - L* = 19
9 Partially correct 27 ms 2392 KB Output is partially correct - L* = 19
10 Partially correct 27 ms 2396 KB Output is partially correct - L* = 22
11 Partially correct 30 ms 2372 KB Output is partially correct - L* = 17
12 Partially correct 27 ms 2464 KB Output is partially correct - L* = 22
13 Partially correct 28 ms 2376 KB Output is partially correct - L* = 17
14 Partially correct 27 ms 2624 KB Output is partially correct - L* = 20
15 Partially correct 27 ms 2404 KB Output is partially correct - L* = 21
16 Partially correct 27 ms 2396 KB Output is partially correct - L* = 15
17 Partially correct 27 ms 2308 KB Output is partially correct - L* = 20
18 Partially correct 29 ms 2400 KB Output is partially correct - L* = 20
19 Partially correct 27 ms 2396 KB Output is partially correct - L* = 17
20 Partially correct 27 ms 2372 KB Output is partially correct - L* = 16
21 Partially correct 27 ms 2368 KB Output is partially correct - L* = 15
22 Partially correct 27 ms 2480 KB Output is partially correct - L* = 17
23 Partially correct 30 ms 2408 KB Output is partially correct - L* = 21
24 Partially correct 27 ms 2396 KB Output is partially correct - L* = 14
25 Partially correct 29 ms 2532 KB Output is partially correct - L* = 15
26 Partially correct 27 ms 2480 KB Output is partially correct - L* = 22
27 Partially correct 27 ms 2372 KB Output is partially correct - L* = 21
28 Partially correct 27 ms 2308 KB Output is partially correct - L* = 21
29 Partially correct 27 ms 2372 KB Output is partially correct - L* = 20
30 Partially correct 27 ms 2404 KB Output is partially correct - L* = 18
31 Partially correct 30 ms 2560 KB Output is partially correct - L* = 14
32 Partially correct 27 ms 2476 KB Output is partially correct - L* = 14
33 Partially correct 27 ms 2368 KB Output is partially correct - L* = 20
34 Partially correct 27 ms 2392 KB Output is partially correct - L* = 15
35 Partially correct 27 ms 2372 KB Output is partially correct - L* = 22
36 Partially correct 27 ms 2392 KB Output is partially correct - L* = 20
37 Partially correct 27 ms 2492 KB Output is partially correct - L* = 22
38 Partially correct 27 ms 2372 KB Output is partially correct - L* = 21
39 Partially correct 27 ms 2524 KB Output is partially correct - L* = 19
40 Partially correct 27 ms 2404 KB Output is partially correct - L* = 18