oj.uz

답안 #100088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100088 2019-03-09T08:22:50 Z oolimry Broken Device (JOI17_broken_device) C++14
0 / 100
 69 ms 3312 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
    set<int> bad;
    for(int i = 0;i < K;i++){
        bad.insert(P[i]);
    }
    int ter[36];
    for(int i = 0;i < 36;i++){
        ter[i] = X % 3;
        X /= 3;
        //cout << ter[i] << " ";
    }
    //cout << "\n";
    int c = 0;
    for(int i = 0;i < N;i++){
        if(i % 2 == 0) continue;
        else{
            if(bad.find(i) != bad.end() || bad.find(i-1) != bad.end()){
                Set(i,0);
                Set(i-1,0);
            }
            else{
                if(c == 36){
                    Set(i-1,0);
                    Set(i,0);

                }
                else{

                    if(ter[c] == 0){
                        Set(i-1,0);
                        Set(i,1);
                    }
                    else if(ter[c] == 1){
                        Set(i-1,1);
                        Set(i,0);
                    }
                    else{
                        Set(i-1,1);
                        Set(i,1);
                    }
                    c++;
                }
            }
        }
    }

}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
  long long ans = 0ll;
  int ter[36];
  int c = 0;
  for(int i = 0;i < N;i++){
        if(i % 2 == 0) continue;
        else{
            int a = A[i-1];
            int b = A[i];
            if(a == 0 && b == 0){
                continue;
            }
            else{

                if(a == 0 && b == 1){
                    ter[c] = 0;
                }
                else if(a == 1 && b == 0){
                    ter[c] = 1;
                }
                else{
                    ter[c] = 2;
                }
                c++;
            }
        }
  }
  for(int i = 0;i < 36;i++){
        //ter[i] = X % 3;
       // X /= 3;
        //cout << ter[i] << " ";
    }
  for(int i = 35;i >= 0;i--){
    ans *= 3;
    ans += ter[i];
  }
  //cout << "\n" << ans;
  return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
2 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
3 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
4 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
5 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
6 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
7 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
8 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
9 Incorrect 40 ms 3000 KB Output isn't correct - L* = 0
10 Incorrect 42 ms 3048 KB Output isn't correct - L* = 0
11 Incorrect 42 ms 3056 KB Output isn't correct - L* = 0
12 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
13 Incorrect 39 ms 3064 KB Output isn't correct - L* = 0
14 Incorrect 54 ms 3056 KB Output isn't correct - L* = 0
15 Incorrect 39 ms 3048 KB Output isn't correct - L* = 0
16 Incorrect 50 ms 3072 KB Output isn't correct - L* = 0
17 Incorrect 69 ms 3016 KB Output isn't correct - L* = 0
18 Incorrect 43 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
20 Incorrect 52 ms 3280 KB Output isn't correct - L* = 0
21 Incorrect 54 ms 3072 KB Output isn't correct - L* = 0
22 Incorrect 53 ms 3072 KB Output isn't correct - L* = 0
23 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
24 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
25 Incorrect 49 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 43 ms 3072 KB Output isn't correct - L* = 0
27 Incorrect 41 ms 3056 KB Output isn't correct - L* = 0
28 Incorrect 48 ms 3072 KB Output isn't correct - L* = 0
29 Incorrect 43 ms 3056 KB Output isn't correct - L* = 0
30 Incorrect 55 ms 3056 KB Output isn't correct - L* = 0
31 Incorrect 42 ms 3072 KB Output isn't correct - L* = 0
32 Incorrect 40 ms 3064 KB Output isn't correct - L* = 0
33 Incorrect 41 ms 3000 KB Output isn't correct - L* = 0
34 Incorrect 41 ms 3016 KB Output isn't correct - L* = 0
35 Incorrect 49 ms 3056 KB Output isn't correct - L* = 0
36 Incorrect 49 ms 3312 KB Output isn't correct - L* = 0
37 Incorrect 55 ms 3056 KB Output isn't correct - L* = 0
38 Incorrect 53 ms 3056 KB Output isn't correct - L* = 0
39 Incorrect 51 ms 3312 KB Output isn't correct - L* = 0
40 Incorrect 46 ms 3064 KB Output isn't correct - L* = 0