oj.uz

Submission #949264

# Submission time Handle Problem Language Result Execution time Memory
949264 2024-03-19T04:38:43 Z vjudge1 Sirni (COCI17_sirni) C++17
98 / 140
 5000 ms 471908 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
#define int long long

using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 1e7 + 2;

int32_t p[N];
bool have[N];
int32_t par[N],sz[N];

int find(int a){
    if(par[a] == a)
        return a;
    return par[a] = find(par[a]);
}
void connect(int a, int b){
    a = find(a);
    b = find(b);
    if(a==b)
		return;
	if(sz[a] < sz[b])
		swap(a,b);
 
	par[b] = a;
	sz[a] += sz[b];
}

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n;
	cin >> n;
	set <int32_t> st;
	for(int i = 1; i <= n; i++){
		cin >> p[i];
		have[p[i]] = 1;
		st.insert(p[i]);
	}
	
	vector <pair <int32_t, pair <int32_t,int32_t> >  > g;
	for(int32_t i = 1; i < N; i++){
		if(!have[i])continue;
		while(!st.empty() && *st.begin() <= i)
			st.erase(st.begin());
		if(st.empty())break;
		sz[i] = 1;
		par[i] = i;
		for(int32_t j = i; j < N; j += i){
			if(have[j] == 1 && i != j){
				g.pb({0, {j, i}});
			}
			auto it = st.upper_bound(j);	
			if(it == st.end())break;
			j = *it;	
			j = j - (j % i);
			g.pb({*it - j, {*it, i}});
		}
	}
	sort(all(g));
	long long ans = 0;
	for(auto x : g){
		if(find(x.ss.ff) != find(x.ss.ss)){
			connect(x.ss.ff, x.ss.ss);
			ans += x.ff;
		}
	}
	cout << ans << endl;
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

sirni.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main(){
      | ^~~~
sirni.cpp: In function 'void fp(std::string)':
sirni.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 88660 KB Output is correct
2 Correct 50 ms 91076 KB Output is correct
3 Correct 19 ms 88860 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8792 KB Output is correct
2 Correct 25 ms 87496 KB Output is correct
3 Correct 16 ms 88856 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 88924 KB Output is correct
2 Correct 14 ms 72332 KB Output is correct
3 Correct 16 ms 88924 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 42568 KB Output is correct
2 Correct 1341 ms 70344 KB Output is correct
3 Correct 460 ms 39236 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17868 KB Output is correct
2 Correct 508 ms 60772 KB Output is correct
3 Correct 358 ms 41464 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 65620 KB Output is correct
2 Correct 1741 ms 113088 KB Output is correct
3 Correct 464 ms 41456 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 17340 KB Output is correct
2 Correct 1526 ms 113968 KB Output is correct
3 Correct 416 ms 40620 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 468 ms 110504 KB Output is correct
2 Execution timed out 5013 ms 414444 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 112164 KB Output is correct
2 Execution timed out 5056 ms 471908 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 92040 KB Output is correct
2 Execution timed out 5088 ms 453760 KB Time limit exceeded
3 Halted 0 ms 0 KB -