oj.uz

Submission #949244

# Submission time Handle Problem Language Result Execution time Memory
949244 2024-03-19T04:06:54 Z vjudge1 Sirni (COCI17_sirni) C++17
98 / 140
 5000 ms 470308 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 <array <int32_t, 3> > 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 &[cost, a, b] : g){
		if(find(a) != find(b)){
			connect(a, b);
			ans += cost;
		}
	}
	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 88664 KB Output is correct
2 Correct 61 ms 91080 KB Output is correct
3 Correct 18 ms 89020 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Correct 29 ms 87508 KB Output is correct
3 Correct 28 ms 88856 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 88920 KB Output is correct
2 Correct 13 ms 72280 KB Output is correct
3 Correct 17 ms 88924 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 471 ms 42676 KB Output is correct
2 Correct 1712 ms 70304 KB Output is correct
3 Correct 583 ms 38828 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 17468 KB Output is correct
2 Correct 699 ms 61392 KB Output is correct
3 Correct 469 ms 42228 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1103 ms 64684 KB Output is correct
2 Correct 2304 ms 112696 KB Output is correct
3 Correct 597 ms 41268 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 18360 KB Output is correct
2 Correct 2050 ms 114080 KB Output is correct
3 Correct 540 ms 39984 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 110672 KB Output is correct
2 Execution timed out 5086 ms 414084 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 110808 KB Output is correct
2 Execution timed out 5047 ms 470308 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 92872 KB Output is correct
2 Execution timed out 5082 ms 455856 KB Time limit exceeded
3 Halted 0 ms 0 KB -