Submission #3271134
Source Code Expand
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ll inf = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a) {
if(a<0)return -1;
if(a>0)return 1;
return 0;
}
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename T> inline void in(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
ll twop(int x) {
return 1LL<<x;
}
template<typename A,typename B > inline void in(A&x,B&y) {
in(x);
in(y);
}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z) {
in(x);
in(y);
in(z);
}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&d) {
in(x);
in(y);
in(z);
in(d);
}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
namespace SOLVE {
void main(){
}
}
bool poss[51][51][51];
VLL from[50];
VLL to;
ll n;
int getMinReq(){
REP(i,0,51){
bool ok = 1;
REP(j,0,n){
bool ook = 0;
for(auto fr:from[j]){
if(poss[fr][i][to[j]])ook = 1;
}
if(!ook)ok = 0;
}
if(ok)return i;
}
return -1;
}
int main() {
REP(use,0,51){
REP(j,0,51)poss[j][use][j] = 1;
}
REP(from,1,51){
REP(j,1,51){
REP(to,0,51){
if(poss[from%j][j][to])poss[from][j][to] = 1;
if(poss[from][j-1][to])poss[from][j][to] = 1;
}
}
}
in(n);
REP(i,0,n){
int c;in(c);
from[i].PB(c);
}
REP(i,0,n){
int c;in(c);
to.PB(c);
}
ll ans = 0;
while (true) {
int minreq = getMinReq();
if(minreq == -1){
cout<<-1;exit(0);
}
if(minreq == 0)break;
ans += 1LL<<minreq;
REP(i,0,n){
int tmp = sz(from[i]);
REP(j,0,tmp)from[i].PB(from[i][j]%minreq);
sort(all(from[i]));
complete_unique(from[i]);
}
}
cout<<ans;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Remainder Game |
User |
samzhang |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4267 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
384 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
1 ms |
384 KB |
02.txt |
AC |
2 ms |
384 KB |
03.txt |
AC |
1 ms |
384 KB |
04.txt |
AC |
2 ms |
384 KB |
05.txt |
AC |
2 ms |
384 KB |
06.txt |
AC |
1 ms |
384 KB |
07.txt |
AC |
1 ms |
384 KB |
08.txt |
AC |
2 ms |
384 KB |
09.txt |
AC |
1 ms |
384 KB |
10.txt |
AC |
2 ms |
384 KB |
11.txt |
AC |
2 ms |
384 KB |
12.txt |
AC |
1 ms |
384 KB |
13.txt |
AC |
2 ms |
384 KB |
14.txt |
AC |
2 ms |
384 KB |
15.txt |
AC |
2 ms |
384 KB |
16.txt |
AC |
2 ms |
384 KB |
17.txt |
AC |
2 ms |
384 KB |
18.txt |
AC |
2 ms |
384 KB |
19.txt |
AC |
2 ms |
384 KB |
20.txt |
AC |
2 ms |
384 KB |
21.txt |
AC |
2 ms |
384 KB |
22.txt |
AC |
2 ms |
384 KB |
23.txt |
AC |
2 ms |
384 KB |
24.txt |
AC |
1 ms |
384 KB |
25.txt |
AC |
1 ms |
384 KB |
26.txt |
AC |
1 ms |
384 KB |
27.txt |
AC |
1 ms |
384 KB |
28.txt |
AC |
1 ms |
384 KB |
29.txt |
AC |
1 ms |
384 KB |
30.txt |
AC |
1 ms |
384 KB |
31.txt |
AC |
1 ms |
384 KB |
32.txt |
AC |
1 ms |
384 KB |
33.txt |
AC |
1 ms |
384 KB |
34.txt |
AC |
1 ms |
384 KB |
35.txt |
AC |
1 ms |
384 KB |
36.txt |
AC |
1 ms |
384 KB |
37.txt |
AC |
1 ms |
384 KB |
38.txt |
AC |
2 ms |
384 KB |
39.txt |
AC |
2 ms |
384 KB |
40.txt |
AC |
1 ms |
384 KB |
41.txt |
AC |
1 ms |
384 KB |
42.txt |
AC |
1 ms |
384 KB |
43.txt |
AC |
2 ms |
384 KB |
44.txt |
AC |
2 ms |
384 KB |
45.txt |
AC |
2 ms |
384 KB |
46.txt |
AC |
2 ms |
384 KB |
47.txt |
AC |
2 ms |
384 KB |
48.txt |
AC |
2 ms |
384 KB |
49.txt |
AC |
1 ms |
384 KB |
50.txt |
AC |
2 ms |
384 KB |
51.txt |
AC |
1 ms |
384 KB |
52.txt |
AC |
2 ms |
384 KB |
53.txt |
AC |
2 ms |
384 KB |
s1.txt |
AC |
1 ms |
384 KB |
s2.txt |
AC |
1 ms |
384 KB |
s3.txt |
AC |
1 ms |
384 KB |
s4.txt |
AC |
1 ms |
384 KB |
s5.txt |
AC |
1 ms |
384 KB |