Submission #113683

# Submission time Handle Problem Language Result Execution time Memory
113683 2019-05-27T18:13:57 Z rajarshi_basu Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
Compilation error
0 ms 0 KB
#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <fstream>
#include <complex>
#include <stack>
#include <set>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define ld long double
#define pld pair<ld,ld>
#define iii pair<ii,int>

const ld INF = 1e9+10;
using namespace std;
const int MAXN = 1000*100*2+10;
const int MAXVAL = 1e9+10;

const int N = 1000;
int mp[N];
void precalc(){
	int ptr = 0;
	FOR(mask,1<<12){
		int ctr = 0;
		FOR(i,12){
			if((mask&(1<<i))>0)ctr++;
		}
		if(ctr == 6){
			mp[ptr] = mask;
			ptr++;
		}
	}
}

#define endl '\n'
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	precalc();
	int n,t;
	int typ;
	cin >> typ >> n >> t;
	if(typ == 1){
		while(t--){
			int a,b;
			cin >> a >> b;
			int ptr = 0;
			while(1){
				if((mp[a]&(1<<ptr))>0){
					if((mp[b]&(1<<ptr)) == 0){
						break;
					}
				}
				ptr++;
			}
			cout << ptr+1 << endl;
		}
	}else{
		while(t--){
			int q,h;
			cin >> q >> h;
			h--;
			if(q&(1<<h)){
				cout << "yes" << endl;
			}else{
				cout << "no" << endl;
			}
		}
	}

	return 0;
}
#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <fstream>
#include <complex>
#include <stack>
#include <set>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define ld long double
#define pld pair<ld,ld>
#define iii pair<ii,int>

const ld INF = 1e9+10;
using namespace std;
const int MAXN = 1000*100*2+10;
const int MAXVAL = 1e9+10;

const int N = 1000;
int mp[N];
void precalc(){
	int ptr = 0;
	FOR(mask,1<<12){
		int ctr = 0;
		FOR(i,12){
			if((mask&(1<<i))>0)ctr++;
		}
		if(ctr == 6){
			mp[ptr] = mask;
			ptr++;
		}
	}
}

#define endl '\n'
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	precalc();
	int n,t;
	int typ;
	cin >> typ >> n >> t;
	if(typ == 1){
		while(t--){
			int a,b;
			cin >> a >> b;
			int ptr = 0;
			while(1){
				if((mp[a]&(1<<ptr))>0){
					if((mp[b]&(1<<ptr)) == 0){
						break;
					}
				}
				ptr++;
			}
			cout << ptr+1 << endl;
		}
	}else{
		while(t--){
			int q,h;
			cin >> q >> h;
			h--;
			if(q&(1<<h)){
				cout << "yes" << endl;
			}else{
				cout << "no" << endl;
			}
		}
	}

	return 0;
}

Compilation message

/tmp/ccgBGMRP.o: In function `main':
grader_encode.c:(.text.startup+0x0): multiple definition of `main'
/tmp/ccOZOBZi.o:encoder.cpp:(.text.startup+0x0): first defined here
/tmp/ccgBGMRP.o: In function `main':
grader_encode.c:(.text.startup+0x10a): undefined reference to `encode(int, int, int)'
collect2: error: ld returned 1 exit status

/tmp/ccemrXZZ.o: In function `main':
grader_decode.c:(.text.startup+0x0): multiple definition of `main'
/tmp/ccOtGhLq.o:decoder.cpp:(.text.startup+0x0): first defined here
/tmp/ccemrXZZ.o: In function `main':
grader_decode.c:(.text.startup+0x19f): undefined reference to `decode(int, int, int)'
collect2: error: ld returned 1 exit status