Submission #564755

# Submission time Handle Problem Language Result Execution time Memory
564755 2022-05-19T15:09:26 Z Majid Question (Grader is different from the original contest) (CEOI14_question_grader) C++17
0 / 100
1796 ms 24176 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;
        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-1)));
    else return !(q&(1<<(h-1)));
}
# Verdict Execution time Memory Grader output
1 Incorrect 1796 ms 23984 KB wrong answer
2 Incorrect 1743 ms 24176 KB wrong answer