oj.uz

답안 #564753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564753 2022-05-19T15:03:59 Z Majid 질문 (CEOI14_question_grader) C++17
0 / 100
 1794 ms 24028 KB 
#include<bits/stdc++.h>
using namespace std;
 
//Types
using ll = long long;
using db = double;
 
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
 
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);

int encode(int n, int x, int y){
	
        int num = -1, num2 = -1;
        
        for(ll i = 0; i < 10; i++){
            
            if  (x&(1<<i) and !(y&(1<<i)))num = i+1;
            else if(!(x&(1<<i)) and (y&(1<<i)))num2 = i+1;
        }
        
        if(num!=-1)return num;
        else return 10+num2;
}

#include<bits/stdc++.h>
using namespace std;
 
//Types
using ll = long long;
using db = double;
 
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
 
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);

int decode(int n, int q, int h){
	
    if(h<=10)return (q&(1<<h));
    else return !(q&(1<<h));
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1794 ms 23944 KB wrong answer
2 Incorrect 1782 ms 24028 KB wrong answer