oj.uz

답안 #926176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926176 2024-02-12T16:39:06 Z amirhoseinfar1385 Broken Device (JOI17_broken_device) C++17
0 / 100
 33 ms 3124 KB 
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;

void Anna( int N, long long x, int k, int p[] ){
  vector<int>wtf(150);
  for(int i=0;i<k;i++){
  	wtf[p[i]]=1;
  }
  for(int i=0;i<N;i+=3){
  	if(wtf[i]+wtf[i+1]+wtf[i+2]>=2){
  		Set(i,0);
  		Set(i+1,0);
  		Set(i+2,0);
  		continue;
  	}
  	if(wtf[i]+wtf[i+1]+wtf[i+2]==0){
  		long long res=0;
  		res=(x&1);
  		x>>=1;
  		res+=((x&1)<<1);
  		x>>=1;
  		if(res==0){
  			Set(i,0);
  			Set(i+1,1);
  			Set(i+2,1);
  		}else if(res==1){
  			Set(i,1);
  			Set(i+1,0);
  			Set(i+2,0);
  		}else if(res==2){
  			Set(i,1);
  			Set(i+1,1);
  			Set(i+2,1);
  		}else{
  			Set(i,1);
  			Set(i+1,1);
  			Set(i+2,0);
  		}
  		continue;
  	}
  	if(x&1){
  		if(wtf[i+2]==0){
  			Set(i,0);
  			Set(i+1,0);
  			Set(i+2,1);
  			x>>=1;
  		}
  		else{
  			x>>=1;
  			if(x&1){
  				Set(i,1);
  				Set(i+1,1);
  				Set(i+2,0);
  			}
  			else{
  				Set(i,1);
  				Set(i+1,0);
  				Set(i+2,0);
  			}
  			x>>=1;
  		}
  	}
  	else{
  		if(wtf[i+1]==1){
  			Set(i,1);
  			Set(i+1,0);
  			Set(i+2,1);
  		}
  		else{
  			Set(i,0);
  			Set(i+1,1);
  			Set(i+2,0);
  		}
  		x>>=1;
  	}
  }
}

#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;

long long Bruno( int N, int A[] ){
  long long res=0;
  vector<long long>all(150);
  for(int i=0;i<N;i++){
    all[i]=A[i];
  }
  long long now=0;
  for(int i=0;i<N;i++){
    long long fake=all[i+2]+all[i+1]*2+all[i]*4;
    if(fake==0){
      continue;
    }
    if(fake==1){
      res+=(1<<now);
      now++;
    }
    if(fake==2){
      now++;
    }
    if(fake==3){
      now+=2;
      continue;
    }
    if(fake==4){
      res+=(1<<now);
      now+=2;
    }
    if(fake==5){
      now++;
    }
    if(fake==6){
      res+=(1<<now)*3;
      now+=2;
    }
    if(fake==7){
      res+=(1<<now)*2;
      now+=2;
    }
  }
  return res;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 25 ms 2812 KB Output isn't correct - L* = 0
2 Partially correct 30 ms 2848 KB Output isn't correct - L* = 0
3 Partially correct 26 ms 2780 KB Output isn't correct - L* = 0
4 Partially correct 30 ms 2716 KB Output isn't correct - L* = 0
5 Partially correct 26 ms 2920 KB Output isn't correct - L* = 0
6 Partially correct 26 ms 2756 KB Output isn't correct - L* = 0
7 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
8 Partially correct 26 ms 2684 KB Output isn't correct - L* = 0
9 Partially correct 26 ms 2688 KB Output isn't correct - L* = 0
10 Partially correct 26 ms 2756 KB Output isn't correct - L* = 0
11 Partially correct 26 ms 2832 KB Output isn't correct - L* = 0
12 Partially correct 26 ms 2816 KB Output isn't correct - L* = 0
13 Partially correct 26 ms 2864 KB Output isn't correct - L* = 0
14 Partially correct 26 ms 2856 KB Output isn't correct - L* = 0
15 Partially correct 26 ms 2780 KB Output isn't correct - L* = 0
16 Partially correct 26 ms 2784 KB Output isn't correct - L* = 0
17 Partially correct 27 ms 2624 KB Output isn't correct - L* = 0
18 Partially correct 27 ms 2852 KB Output isn't correct - L* = 0
19 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
20 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
21 Partially correct 26 ms 2772 KB Output isn't correct - L* = 0
22 Partially correct 26 ms 2780 KB Output isn't correct - L* = 0
23 Partially correct 28 ms 2772 KB Output isn't correct - L* = 0
24 Partially correct 26 ms 2788 KB Output isn't correct - L* = 0
25 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
26 Partially correct 25 ms 2856 KB Output isn't correct - L* = 0
27 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
28 Partially correct 28 ms 2744 KB Output isn't correct - L* = 0
29 Partially correct 33 ms 2764 KB Output isn't correct - L* = 0
30 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
31 Partially correct 26 ms 2608 KB Output isn't correct - L* = 0
32 Partially correct 25 ms 2780 KB Output isn't correct - L* = 0
33 Partially correct 28 ms 2672 KB Output isn't correct - L* = 0
34 Partially correct 26 ms 2984 KB Output isn't correct - L* = 0
35 Partially correct 26 ms 2672 KB Output isn't correct - L* = 0
36 Partially correct 26 ms 3124 KB Output isn't correct - L* = 0
37 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
38 Partially correct 25 ms 2772 KB Output isn't correct - L* = 0
39 Partially correct 26 ms 2772 KB Output isn't correct - L* = 0
40 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0