oj.uz

답안 #1077202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077202 2024-08-27T02:54:06 Z kwongweng Broken Device (JOI17_broken_device) C++17
0 / 100
 28 ms 3432 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> ii;
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=a; i>=b; i--)
#define pb push_back
#define fi first
#define se second


void Anna( int N, long long X, int K, int P[] ){
  vi pos(N); FOR(i,0,K) pos[P[i]]=1;
  for( int i = 0; i < N/2; i++ ){
    if (pos[2*i]==1 || pos[2*i+1]==1 || X==0){
      Set(2*i,0); Set(2*i+1,0); continue;
    }
    if (X%3==0){
      Set(2*i,0); Set(2*i+1,1);
    }
    if (X%3==1){
      Set(2*i,1); Set(2*i+1,0);
    }
    if (X%3==2){
      Set(2*i,1); Set(2*i+1,1);
    }
    X /= 3;
  }
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> ii;
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=a; i>=b; i--)
#define pb push_back
#define fi first
#define se second


long long Bruno( int N, int A[] ){
  ll val = 0; ll pos = 1;
  FOR(i,0,N/2){
    int id = A[i*2]*2 + A[i*2+1];
    if (id==0) continue;
    val += id * pos; pos *= 3;
    
  }
  return val;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 24 ms 3432 KB Output isn't correct - L* = 0
2 Partially correct 20 ms 2796 KB Output isn't correct - L* = 0
3 Partially correct 27 ms 2740 KB Output isn't correct - L* = 0
4 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
5 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
6 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
7 Partially correct 20 ms 2784 KB Output isn't correct - L* = 0
8 Partially correct 20 ms 2860 KB Output isn't correct - L* = 0
9 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
10 Partially correct 20 ms 2844 KB Output isn't correct - L* = 0
11 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
12 Partially correct 25 ms 2772 KB Output isn't correct - L* = 0
13 Partially correct 20 ms 2780 KB Output isn't correct - L* = 0
14 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
15 Partially correct 20 ms 2780 KB Output isn't correct - L* = 0
16 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
17 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
18 Partially correct 25 ms 2396 KB Output isn't correct - L* = 0
19 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
20 Partially correct 20 ms 2568 KB Output isn't correct - L* = 0
21 Partially correct 20 ms 2456 KB Output isn't correct - L* = 0
22 Partially correct 23 ms 2396 KB Output isn't correct - L* = 0
23 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
24 Partially correct 20 ms 2560 KB Output isn't correct - L* = 0
25 Partially correct 27 ms 2372 KB Output isn't correct - L* = 0
26 Partially correct 26 ms 2620 KB Output isn't correct - L* = 0
27 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
28 Partially correct 20 ms 2304 KB Output isn't correct - L* = 0
29 Partially correct 20 ms 2744 KB Output isn't correct - L* = 0
30 Partially correct 20 ms 2472 KB Output isn't correct - L* = 0
31 Partially correct 28 ms 2400 KB Output isn't correct - L* = 0
32 Partially correct 20 ms 2388 KB Output isn't correct - L* = 0
33 Partially correct 20 ms 2748 KB Output isn't correct - L* = 0
34 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
35 Partially correct 20 ms 2536 KB Output isn't correct - L* = 0
36 Partially correct 22 ms 2396 KB Output isn't correct - L* = 0
37 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
38 Partially correct 25 ms 2392 KB Output isn't correct - L* = 0
39 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
40 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0