oj.uz

답안 #1077269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077269 2024-08-27T04:27:39 Z veehj Broken Device (JOI17_broken_device) C++17
0 / 100
 30 ms 2852 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;

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

void Anna( int N, long long X, int K, int P[] ){
  set<int> s;
  findans(X);
  for(int i=0; i<K; i++) s.insert(P[i]);
  for(int i=0; i<N; i+=2){
    if(s.count(i) || s.count(i+1) || st.size()==0){
      Set(i, 0);
      Set(i+1, 0);
      continue;
    }
    if(st.top()==0){
      Set(i, 0);
      Set(i+1, 1);
    }
    if(st.top()==1){
      Set(i, 1);
      Set(i+1, 0);
    }
    if(st.top()==2){
      Set(i, 1);
      Set(i+1, 1);
    }
    st.pop();
  }
}
#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()

long long Bruno( int N, int A[] ){
  queue<int> q;
  for(int i=0; i<N; i+=2){
    if(A[i]==A[i+1] && A[i]==0) continue;
    int x=A[i]*2+A[i+1]-1;
    q.push(x);
  }
  int ans=0;
  while(!q.empty()){
    ans*=3;
    ans+=q.front();
    q.pop();
  }
  return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
2 Partially correct 28 ms 2776 KB Output isn't correct - L* = 0
3 Partially correct 28 ms 2748 KB Output isn't correct - L* = 0
4 Partially correct 23 ms 2772 KB Output isn't correct - L* = 0
5 Partially correct 24 ms 2772 KB Output isn't correct - L* = 0
6 Partially correct 24 ms 2752 KB Output isn't correct - L* = 0
7 Partially correct 23 ms 2764 KB Output isn't correct - L* = 0
8 Partially correct 23 ms 2752 KB Output isn't correct - L* = 0
9 Partially correct 26 ms 2676 KB Output isn't correct - L* = 0
10 Partially correct 24 ms 2784 KB Output isn't correct - L* = 0
11 Partially correct 24 ms 2780 KB Output isn't correct - L* = 0
12 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0
13 Partially correct 24 ms 2640 KB Output isn't correct - L* = 0
14 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
15 Partially correct 22 ms 2772 KB Output isn't correct - L* = 0
16 Partially correct 28 ms 2744 KB Output isn't correct - L* = 0
17 Partially correct 22 ms 2768 KB Output isn't correct - L* = 0
18 Partially correct 23 ms 2772 KB Output isn't correct - L* = 0
19 Partially correct 23 ms 2784 KB Output isn't correct - L* = 0
20 Partially correct 30 ms 2752 KB Output isn't correct - L* = 0
21 Partially correct 24 ms 2748 KB Output isn't correct - L* = 0
22 Partially correct 26 ms 2844 KB Output isn't correct - L* = 0
23 Partially correct 24 ms 2772 KB Output isn't correct - L* = 0
24 Partially correct 23 ms 2840 KB Output isn't correct - L* = 0
25 Partially correct 24 ms 2760 KB Output isn't correct - L* = 0
26 Partially correct 25 ms 2784 KB Output isn't correct - L* = 0
27 Partially correct 23 ms 2776 KB Output isn't correct - L* = 0
28 Partially correct 23 ms 2748 KB Output isn't correct - L* = 0
29 Partially correct 23 ms 2744 KB Output isn't correct - L* = 0
30 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
31 Partially correct 27 ms 2768 KB Output isn't correct - L* = 0
32 Partially correct 23 ms 2776 KB Output isn't correct - L* = 0
33 Partially correct 24 ms 2792 KB Output isn't correct - L* = 0
34 Partially correct 22 ms 2772 KB Output isn't correct - L* = 0
35 Partially correct 22 ms 2852 KB Output isn't correct - L* = 0
36 Partially correct 23 ms 2708 KB Output isn't correct - L* = 0
37 Partially correct 23 ms 2776 KB Output isn't correct - L* = 0
38 Partially correct 28 ms 2788 KB Output isn't correct - L* = 0
39 Partially correct 23 ms 2760 KB Output isn't correct - L* = 0
40 Partially correct 23 ms 2752 KB Output isn't correct - L* = 0