Submission #1260940

#TimeUsernameProblemLanguageResultExecution timeMemory
1260940user736482Question (Grader is different from the original contest) (CEOI14_question_grader)C++20
0 / 100
470 ms43532 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define ff first #define ss second #define MOD 1000000007 #define INF 1000000019 #define POT (1<<20) #define INFL 1000000000000000099 ll a,b,c,n,t; vector<vector<ll>>gen(){ vector<vector<ll>>vv; for(ll i=0;i<(1<<12);i++){ vector<ll>x; ll d=0; for(ll j=0;j<12;j++){ x.pb((bool)((1<<j) & i)); d+=x.back(); } if(d==6)vv.pb(x); } return vv; } vector<vector<ll>>v=gen(); int encode(int n,int a,int b){ for(ll i=0;i<12;i++){ if(v[a][i]==1 && v[b][i]==0)return a; } } int decode(int n,int a,int b){ return v[a][b]; }
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define ff first #define ss second #define MOD 1000000007 #define INF 1000000019 #define POT (1<<20) #define INFL 1000000000000000099 ll a,b,c,n,t; vector<vector<ll>>gen(){ vector<vector<ll>>vv; for(ll i=0;i<(1<<12);i++){ vector<ll>x; ll d=0; for(ll j=0;j<12;j++){ x.pb((bool)((1<<j) & i)); d+=x.back(); } if(d==6)vv.pb(x); } return vv; } vector<vector<ll>>v=gen(); int encode(int n,int a,int b){ for(ll i=0;i<12;i++){ if(v[a][i]==1 && v[b][i]==0)return a; } } int decode(int n,int a,int b){ return v[a][b]; }

Compilation message (stderr)

# 1번째 컴파일 단계

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:34:5: warning: control reaches end of non-void function [-Wreturn-type]
   34 |     }
      |     ^

# 2번째 컴파일 단계

decoder.cpp: In function 'int encode(int, int, int)':
decoder.cpp:34:5: warning: control reaches end of non-void function [-Wreturn-type]
   34 |     }
      |     ^
#Verdict Execution timeMemoryGrader output
Fetching results...