답안 #308312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308312	2020-09-30T22:48:38 Z	MatheusLealV	Strongbox (POI11_sej)	C++17	0 / 100	1000 ms	18132 KB

#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
 
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll mod = (1000000007LL);
inline ll Mod(ll a, ll b){return (a%b);}
inline ll poww(ll a, ll b){ll res = 1;while (b > 0){if(b & 1) res = (res * a)%mod;a = (a * a)%mod;b >>= 1;}return res;}
ll gcd (ll a, ll b) { while (b) { a %= b,swap(a, b);}return a;}
void read(vector<int> &w, int n){w.resize(n);for(int i = 0; i < n; i++) cin>>w[i];}
void print(vector<int> &w){for(int i =0; i < sz(w); i++){if(i == sz(w) - 1) cout<<w[i]<<"\n";else cout<<w[i]<<" ";}}
int prodmod(vector<int> w);
int summod(vector<int> w);
///CUIDADO COM MAXN
#define N 300050
 
int n, m, q, k, v[N], ans;
// vector<int> grafo[N];
pii w[N];
string s;


bool check(int y){
	set<int> caras, block;
	for(int i = 1; i < k; i++) block.insert(v[i]);
	int pos = y%n;

	while(true){
		if(caras.count(pos)) break;
		caras.insert(pos);
		if(block.count(pos)) return false;
		pos += y;
		pos %= n;
	}

	return true;

}	
 
int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n>>k;
	// set<int> caras;
	vector<int> primes;
	for(int i = 1; i < k; i++){
		cin>>v[i];
		int x = v[i];
		for(int j = 2; j*j <= sqrt(x); j++){
			int qtd = 0;
			while(x % j == 0){
				x /= j;
				qtd++;
			}
			if(qtd) primes.pb(j);
		}
 
		if(x > 1) primes.pb(x);
	}
	cin>>v[k];
	sort(all(primes));
	primes.erase(unique(all(primes)), primes.end());
	if(k == 1){
		cout<<n<<"\n";
		return 0;
	}
	int x = v[k], menorfat = (int)(2e18), can=0;
	for(int j = 1; j <= sqrt(x); j++){
		int ok = 1;
		if(x % j == 0){
			int y = j;
			int ok = 1;
			int d = __gcd(y, n);
			for(int p = 1; p < k; p++){
				if(v[p] % d == 0) ok = 0;
			}
			if(ok) menorfat =min(menorfat, y), can=1;
			ok = 1;
			y = x/j;
			d = __gcd(y, n);
			for(int p = 1; p < k; p++){
				if(v[p]%d == 0) ok = 0;
			}
			if(ok) menorfat =min(menorfat, y), can=1;
		}
	}
 
	assert(can);
	cout<<n/menorfat<<"\n";
}
/*
    CUIDADO COM MAXN, MOD, OVERFLOW 
    >Colocar (>DEFINE INT LONG LONG<) no inicio do template
    >mod = (1e9 + 7), por padrao (NAO ESQUECER DE ALTERAR)
    >NAO ESQUECER DEFINE INT LONG LONG
    > N = 1 ? 
*/
int summod(vector<int> w){int curr=0;for(int i=0;i<sz(w); i++){curr = (curr+w[i])%mod;if(curr<0)curr+=mod;}return curr;}
int prodmod(vector<int> w){int curr = 1;
for(int i = 0; i < sz(w); i++){if(w[i] >= mod) w[i] %= mod;curr = (curr * w[i]) % mod;if(curr < 0) curr += mod;}return curr;}

Compilation message

sej.cpp: In function 'int32_t main()':
sej.cpp:78:7: warning: unused variable 'ok' [-Wunused-variable]
   78 |   int ok = 1;
      |       ^~

Subtask #1
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Runtime error	2 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	2 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #4
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	2 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	10 ms	384 KB	Output is correct
3	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
4	Halted	0 ms	0 KB	-

Subtask #6
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	384 KB	Output is correct
2	Correct	56 ms	512 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Runtime error	3 ms	768 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #7
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	5 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	71 ms	504 KB	Output is correct
2	Correct	102 ms	504 KB	Output is correct
3	Correct	12 ms	384 KB	Output is correct
4	Runtime error	3 ms	768 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #10
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	512 KB	Output is correct
2	Correct	97 ms	472 KB	Output is correct
3	Correct	79 ms	384 KB	Output is correct
4	Runtime error	3 ms	768 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #11
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	120 ms	6752 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	721 ms	9828 KB	Output is correct
2	Execution timed out	1095 ms	18132 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #13
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	480 ms	9952 KB	Output is correct
2	Execution timed out	1076 ms	18128 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #14
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	432 ms	10332 KB	Output is correct
2	Execution timed out	1099 ms	18044 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-