답안 #34694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
34694	2017-11-15T02:38:32 Z	imaxblue	질문 (CEOI14_question_grader)	C++14	0 / 100	1283 ms	27496 KB

encoder

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int n, p=1, t, q, x, y;
bool a[13], u[1000][13], k;
void dfs(int N, int K){
    if (N==13 && K<6 || K>6) return;
    if (N==13){
        fox1(l, 12) u[p][l]=a[l];
        ++p;
        return;
    }
    a[N]=0;
    dfs(N+1, K);
    a[N]=1;
    dfs(N+1, K+1);
}
void init(){
    if (!k) dfs(1, 1);
    k=1;
}
int encode(int n, int x, int y){
  		init();
        fox1(l2, 12){
            if (u[x][l2] && !u[y][l2]){
                return l2;
            }
        }
}
/*
8
11
8
11
11
8
*/

decoder

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int n, p=1, t, q, x, y;
bool a[13], u[1000][13], k;
void dfs(int N, int K){
    if (N==13 && K<6 || K>6) return;
    if (N==13){
        fox1(l, 12) u[p][l]=a[l];
        ++p;
        return;
    }
    a[N]=0;
    dfs(N+1, K);
    a[N]=1;
    dfs(N+1, K+1);
}
void init(){
    if (!k) dfs(1, 1);
    k=1;
}
int decode(int n, int x, int y){
  		init();
        if (u[x][y]){
            return 1;
        } else {
            return 0;
        }
}
/*
8
11
8
11
11
8
*/

Compilation message

encoder.cpp: In function 'void dfs(int, int)':
encoder.cpp:30:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if (N==13 && K<6 || K>6) return;
               ^
encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

decoder.cpp: In function 'void dfs(int, int)':
decoder.cpp:30:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if (N==13 && K<6 || K>6) return;
               ^

Subtask #1

0.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1283 ms	27496 KB	wrong answer
2	Incorrect	1166 ms	27496 KB	wrong answer