#include<bits/stdc++.h>
#include <functional>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=1000;
const ll inf=1e9+900;
char ans[maxn][maxn];
ll f[maxn];
void bild(){
ll m=(1<<12);
ll cnt=1;
for(ll i=0;i<m;i++){
if(__builtin_popcount(i)==6){
f[cnt]=i;
cnt++;
}
}
for(ll i=1;i<cnt;i++){
for(ll j=1;j<cnt;j++){
if(i!=j){
ll fj=f[j];
ll fi=(~f[i]);
for(ll u=0;u<12;u++){
if(((fi>>u)&1) && ((fj>>u)&1)){
ans[i][j]=u;
}
}
}
}
}
}
int encode(int n, int x, int y) {
bild();
return ans[x][y];
}
#include<bits/stdc++.h>
#include <functional>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=1000;
const ll inf=1e9+900;
char ans[maxn][maxn];
ll f[maxn];
void bild(){
ll m=(1<<12);
ll cnt=1;
for(ll i=0;i<m;i++){
if(__builtin_popcount(i)==6){
f[cnt]=i;
cnt++;
}
}
for(ll i=1;i<cnt;i++){
for(ll j=1;j<cnt;j++){
if(i!=j){
ll fj=f[j];
ll fi=(~f[i]);
for(ll u=0;u<12;u++){
if(((fi>>u)&1) && ((fj>>u)&1)){
ans[i][j]=u;
}
}
}
}
}
}
int decode(int n, int q, int h) {
bild();
for(ll i=1;i<=n;i++){
for(ll j=1;j<=n;j++){
if(ans[i][j]==h && i==q){
return 0;
}
if(ans[i][j]==h && j==q){
return 1;
}
}
}
}
Compilation message
decoder.cpp: In function 'int decode(int, int, int)':
decoder.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
7020 ms |
1280 KB |
Time limit exceeded |
2 |
Incorrect |
1761 ms |
2584 KB |
Output isn't correct |