oj.uz

답안 #954933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954933 2024-03-28T20:47:04 Z logangd Broken Device (JOI17_broken_device) C++14
0 / 100
 31 ms 2712 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(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<N;i++){
    if(ar[i]==1)Set(i,1);
    else Set(i,0);
  }
}
    #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){   
                curr++;
                i++;
            }else if(A[i]==1&&(i==0||(1<i&&(A[i-1]!=0||A[i-2]!=1))))ans|=((ll)1<<curr),curr++;
        }
        return ans;
    }

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
2 Partially correct 27 ms 2372 KB Output isn't correct - L* = 0
3 Partially correct 25 ms 2404 KB Output isn't correct - L* = 0
4 Partially correct 31 ms 2628 KB Output isn't correct - L* = 0
5 Partially correct 28 ms 2560 KB Output isn't correct - L* = 0
6 Partially correct 26 ms 2404 KB Output isn't correct - L* = 0
7 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
8 Partially correct 28 ms 2392 KB Output isn't correct - L* = 0
9 Partially correct 26 ms 2480 KB Output isn't correct - L* = 0
10 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
11 Partially correct 26 ms 2392 KB Output isn't correct - L* = 0
12 Partially correct 28 ms 2404 KB Output isn't correct - L* = 0
13 Partially correct 28 ms 2400 KB Output isn't correct - L* = 0
14 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
15 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
16 Partially correct 26 ms 2480 KB Output isn't correct - L* = 0
17 Partially correct 26 ms 2508 KB Output isn't correct - L* = 0
18 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
19 Partially correct 26 ms 2536 KB Output isn't correct - L* = 0
20 Partially correct 26 ms 2552 KB Output isn't correct - L* = 0
21 Partially correct 31 ms 2304 KB Output isn't correct - L* = 0
22 Partially correct 26 ms 2712 KB Output isn't correct - L* = 0
23 Partially correct 26 ms 2460 KB Output isn't correct - L* = 0
24 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
25 Partially correct 26 ms 2580 KB Output isn't correct - L* = 0
26 Partially correct 25 ms 2396 KB Output isn't correct - L* = 0
27 Partially correct 26 ms 2404 KB Output isn't correct - L* = 0
28 Partially correct 26 ms 2404 KB Output isn't correct - L* = 0
29 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
30 Partially correct 27 ms 2372 KB Output isn't correct - L* = 0
31 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
32 Partially correct 26 ms 2684 KB Output isn't correct - L* = 0
33 Partially correct 27 ms 2472 KB Output isn't correct - L* = 0
34 Partially correct 25 ms 2396 KB Output isn't correct - L* = 0
35 Partially correct 26 ms 2660 KB Output isn't correct - L* = 0
36 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
37 Partially correct 30 ms 2404 KB Output isn't correct - L* = 0
38 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
39 Partially correct 27 ms 2376 KB Output isn't correct - L* = 0
40 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0