oj.uz

답안 #959479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959479 2024-04-08T09:38:26 Z edogawa_something Broken Device (JOI17_broken_device) C++17
0 / 100
 34 ms 2940 KB 
#include<bits/stdc++.h>
#include "Annalib.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
const ll M=2e5+10;
bool vis[M];
void Anna( int n, long long x, int k, int pos[] ){
  for(int i=0;i<k;i++){
    vis[pos[i]]=1;
  }
  ll cnt=0;
  for(int i=0;i<n;i++){
    if(cnt>60){
      Set(i,0);
      continue;
    }
    if(i<n-1&&!vis[i]&&!vis[i+1]){
      Set(i,1);
      if((x&(1ll<<cnt))>0ll)
      Set(i+1,1);
      else
      Set(i+1,0);
      i++;
      cnt++;
      continue;
    }
    else{
      Set(i,0);
    }
  }
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
long long Bruno(int n,int a[]){
  ll ans=0,cnt=0;
  for(int i=0;i<n;i++){
    if(a[i]==1){
      if(a[i+1]==1){
        ans|=(1ll<<cnt);
        cnt++;
      }
      else{
        cnt++;
      }
      i++;
    }
  }
  return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 25 ms 2684 KB Output isn't correct - L* = 0
2 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
3 Partially correct 25 ms 2748 KB Output isn't correct - L* = 0
4 Partially correct 25 ms 2680 KB Output isn't correct - L* = 0
5 Partially correct 24 ms 2776 KB Output isn't correct - L* = 0
6 Partially correct 25 ms 2828 KB Output isn't correct - L* = 0
7 Partially correct 26 ms 2848 KB Output isn't correct - L* = 0
8 Partially correct 25 ms 2864 KB Output isn't correct - L* = 0
9 Partially correct 28 ms 2760 KB Output isn't correct - L* = 0
10 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0
11 Partially correct 25 ms 2764 KB Output isn't correct - L* = 0
12 Partially correct 25 ms 2824 KB Output isn't correct - L* = 0
13 Partially correct 27 ms 2748 KB Output isn't correct - L* = 0
14 Partially correct 27 ms 2780 KB Output isn't correct - L* = 0
15 Partially correct 25 ms 2652 KB Output isn't correct - L* = 0
16 Partially correct 31 ms 2776 KB Output isn't correct - L* = 0
17 Partially correct 28 ms 2748 KB Output isn't correct - L* = 0
18 Partially correct 27 ms 2748 KB Output isn't correct - L* = 0
19 Partially correct 25 ms 2780 KB Output isn't correct - L* = 0
20 Partially correct 31 ms 2700 KB Output isn't correct - L* = 0
21 Partially correct 26 ms 2860 KB Output isn't correct - L* = 0
22 Partially correct 24 ms 2772 KB Output isn't correct - L* = 0
23 Partially correct 24 ms 2780 KB Output isn't correct - L* = 0
24 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0
25 Partially correct 25 ms 2752 KB Output isn't correct - L* = 0
26 Partially correct 32 ms 2940 KB Output isn't correct - L* = 0
27 Partially correct 26 ms 2688 KB Output isn't correct - L* = 0
28 Partially correct 26 ms 2860 KB Output isn't correct - L* = 0
29 Partially correct 25 ms 2772 KB Output isn't correct - L* = 0
30 Partially correct 26 ms 2756 KB Output isn't correct - L* = 0
31 Partially correct 27 ms 2752 KB Output isn't correct - L* = 0
32 Partially correct 24 ms 2748 KB Output isn't correct - L* = 0
33 Partially correct 25 ms 2748 KB Output isn't correct - L* = 0
34 Partially correct 26 ms 2768 KB Output isn't correct - L* = 0
35 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0
36 Partially correct 24 ms 2776 KB Output isn't correct - L* = 0
37 Partially correct 34 ms 2764 KB Output isn't correct - L* = 0
38 Partially correct 34 ms 2748 KB Output isn't correct - L* = 0
39 Partially correct 24 ms 2768 KB Output isn't correct - L* = 0
40 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0