Submission #344330

#	Time	Username	Problem	Language	Result	Execution time	Memory
344330		NhatMinh0208	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	Compilation error	0 ms	0 KiB

encoder

/*
	Normie's Template v2.0
*/
 
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
int n,m,i,j,k,t,t1,u,v,a,b;
int rep[921];
void gen()
{
	for (int i=0;i<4096;i++)
	{
		if (__builtin_popcount(i)==6)
		{
			t++;
			if (t<=920) rep[t]=i;
		}
	}
}
int main()
{
	fio;
	gen();
  t=1;
	cin>>n>>m;
	for (i=1;i<=m;i++)
	{
		cin>>a>>b;
		if (t==1)
		{
			u=rep[a];
			v=rep[b];
			for (j=0;j<12;j++) if ((u&(1<<j))and(!(v&(1<<j)))) {cout<<j<<endl; break;}
		}
		else
		{
			u=rep[a];
			if (u&(1<<b)) cout<<"yes\n"; else cout<<"no\n";
		}
	}
}

decoder

/*
	Normie's Template v2.0
*/
 
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
int n,m,i,j,k,t,t1,u,v,a,b;
int rep[921];
void gen()
{
	for (int i=0;i<4096;i++)
	{
		if (__builtin_popcount(i)==6)
		{
			t++;
			if (t<=920) rep[t]=i;
		}
	}
}
int main()
{
	fio;
	gen();
  t=2;
	cin>>n>>m;
	for (i=1;i<=m;i++)
	{
		cin>>a>>b;
		if (t==1)
		{
			u=rep[a];
			v=rep[b];
			for (j=0;j<12;j++) if ((u&(1<<j))and(!(v&(1<<j)))) {cout<<j<<endl; break;}
		}
		else
		{
			u=rep[a];
			if (u&(1<<b)) cout<<"yes\n"; else cout<<"no\n";
		}
	}
}

Compilation message (stderr)

encoder.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      | 
/tmp/ccdDekRE.o: In function `main':
grader_encode.c:(.text.startup+0x0): multiple definition of `main'
/tmp/ccduogby.o:encoder.cpp:(.text.startup+0x0): first defined here
/tmp/ccdDekRE.o: In function `main':
grader_encode.c:(.text.startup+0x129): undefined reference to `encode(int, int, int)'
collect2: error: ld returned 1 exit status

decoder.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      | 
/tmp/ccz1JFwc.o: In function `main':
grader_decode.c:(.text.startup+0x0): multiple definition of `main'
/tmp/ccP96Zs0.o:decoder.cpp:(.text.startup+0x0): first defined here
/tmp/ccz1JFwc.o: In function `main':
grader_decode.c:(.text.startup+0x227): undefined reference to `decode(int, int, int)'
collect2: error: ld returned 1 exit status