oj.uz

Submission #1077240

# Submission time Handle Problem Language Result Execution time Memory
1077240 2024-08-27T03:50:01 Z veehj Broken Device (JOI17_broken_device) C++17
0 / 100
 30 ms 2656 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
stack<ll> st;
int pl, curr, cnt=0, n;

void findans(ll x){
  if(x%2) st.push(1);
  else st.push(0);
  x/=2;
  if(x!=0) findans(x);
}

void stop(int till){
  while(pl<=min(till, n-1)){
    Set(pl, 0);
    pl++;
  }
}

void Anna( int N, long long X, int K, int P[] ){
  curr=0, pl=0;
  st={};
  n=N;
  findans(X);
  if(st.size()%2) st.push(1);
  else st.push(0);
  while(pl<N){
    if(curr==K){
      while(1){
        if(st.empty() || pl+2>n-1){
          stop(N-1);
          return;
        }
        Set(pl, 1);
        pl++;
        Set(pl, st.top());
        pl++; st.pop();
        if(st.empty()){
          stop(N-1);
          return;
        }
        Set(pl, st.top());
        pl++; st.pop();
        if(st.empty()){
          stop(N-1);
          return;
        }
      }
    } else {
      if(pl==P[curr]){
        Set(pl, 0);
        pl++; curr++;
        continue;
      }
      while(1){
        if(pl+2>=P[curr]){
          stop(P[curr]);
          curr++;
          break;
        }
        if(st.empty() || pl+2>n-1){
          stop(N-1);
          return;
        }
        Set(pl, 1);
        pl++;
        Set(pl, st.top());
        pl++; st.pop();
        if(st.empty()){
          stop(N-1);
          return;
        }
        Set(pl, st.top());
        pl++; st.pop();
        if(st.empty()){
          stop(N-1);
          return;
        }
      }
    }
  }
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
queue<int> q;
int ok=0;
ll ans=0;

long long Bruno( int N, int A[] ){
  q={};
  for(int i=0; i<N; i++){
    if(A[i]==1){
      i++;
      if(q.empty()) ok=A[i];
      else q.push(A[i]);
      i++;
      q.push(A[i]);
    }
  }
  while(!q.empty()){
    if(q.size()==1 && !ok) break;
    ans*=2;
    ans+=q.front();
    q.pop();
  }
  return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 2396 KB Output isn't correct - L* = 0
2 Partially correct 20 ms 2508 KB Output isn't correct - L* = 0
3 Partially correct 22 ms 2368 KB Output isn't correct - L* = 0
4 Partially correct 24 ms 2396 KB Output isn't correct - L* = 0
5 Partially correct 22 ms 2392 KB Output isn't correct - L* = 0
6 Partially correct 23 ms 2388 KB Output isn't correct - L* = 0
7 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
8 Partially correct 25 ms 2464 KB Output isn't correct - L* = 0
9 Partially correct 20 ms 2476 KB Output isn't correct - L* = 0
10 Partially correct 28 ms 2368 KB Output isn't correct - L* = 0
11 Partially correct 23 ms 2400 KB Output isn't correct - L* = 0
12 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
13 Partially correct 23 ms 2396 KB Output isn't correct - L* = 0
14 Partially correct 26 ms 2480 KB Output isn't correct - L* = 0
15 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
16 Partially correct 26 ms 2404 KB Output isn't correct - L* = 0
17 Partially correct 20 ms 2596 KB Output isn't correct - L* = 0
18 Partially correct 22 ms 2392 KB Output isn't correct - L* = 0
19 Partially correct 22 ms 2396 KB Output isn't correct - L* = 0
20 Partially correct 22 ms 2400 KB Output isn't correct - L* = 0
21 Partially correct 22 ms 2404 KB Output isn't correct - L* = 0
22 Partially correct 22 ms 2392 KB Output isn't correct - L* = 0
23 Partially correct 22 ms 2392 KB Output isn't correct - L* = 0
24 Partially correct 23 ms 2480 KB Output isn't correct - L* = 0
25 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
26 Partially correct 26 ms 2656 KB Output isn't correct - L* = 0
27 Partially correct 23 ms 2400 KB Output isn't correct - L* = 0
28 Partially correct 27 ms 2496 KB Output isn't correct - L* = 0
29 Partially correct 26 ms 2308 KB Output isn't correct - L* = 0
30 Partially correct 22 ms 2404 KB Output isn't correct - L* = 0
31 Partially correct 20 ms 2452 KB Output isn't correct - L* = 0
32 Partially correct 20 ms 2472 KB Output isn't correct - L* = 0
33 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
34 Partially correct 23 ms 2432 KB Output isn't correct - L* = 0
35 Partially correct 24 ms 2396 KB Output isn't correct - L* = 0
36 Partially correct 22 ms 2384 KB Output isn't correct - L* = 0
37 Partially correct 26 ms 2576 KB Output isn't correct - L* = 0
38 Partially correct 20 ms 2400 KB Output isn't correct - L* = 0
39 Partially correct 22 ms 2564 KB Output isn't correct - L* = 0
40 Partially correct 30 ms 2388 KB Output isn't correct - L* = 0