oj.uz

Submission #949198

# Submission time Handle Problem Language Result Execution time Memory
949198 2024-03-19T03:37:49 Z vjudge1 Sirni (COCI17_sirni) C++17
98 / 140
 2856 ms 786432 KB 
#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 int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
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;
int p[N], have[N];
int par[N],sz[N];
int find(int a){
    if(par[a] == a)
        return a;
    return 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 <int> st;
	for(int i = 1; i <= n; i++){
		cin >> p[i];
		have[p[i]] = 1;
		st.insert(p[i]);
	}
	
	vector <array <int, 3> > g;
	for(int i = 1; i < N; i++){
		if(!have[i])continue;
		sz[i] = 1;
		par[i] = i;
		for(int j = i; j < N; j += i){
			auto it = st.lower_bound(j);
			if(it == st.end())break;
			while(*it > j + i){
				j += i;
			}
			g.pb({*it % i, *it, i});
			
			it = st.upper_bound(j);
			if(it == st.end())break;
			while(*it > j + i){
				j += i;
			}
			g.pb({*it % i, *it, i});
		}
		//for(int j = i + 1 ; j <= n; j++){
		//	g.pb({min(p[i] % p[j], p[j] % p[i]), i, j});
		//}
	}
	sort(all(g));
	int ans = 0;
	for(auto &[cost, a, b] : g){
		if(find(a) != find(b)){
			//cout << cost <<" "<< a <<" "<< b << endl;
			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:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main(){
      | ^~~~
sirni.cpp: In function 'void fp(std::string)':
sirni.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | 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 40 ms 207584 KB Output is correct
2 Correct 105 ms 205152 KB Output is correct
3 Correct 36 ms 207820 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7256 KB Output is correct
2 Correct 65 ms 209012 KB Output is correct
3 Correct 37 ms 209612 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 207516 KB Output is correct
2 Correct 23 ms 152412 KB Output is correct
3 Correct 33 ms 203856 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 82452 KB Output is correct
2 Correct 2157 ms 217480 KB Output is correct
3 Correct 745 ms 117916 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 38080 KB Output is correct
2 Correct 919 ms 213228 KB Output is correct
3 Correct 557 ms 70304 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1317 ms 218920 KB Output is correct
2 Correct 2856 ms 413844 KB Output is correct
3 Correct 756 ms 122008 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 34740 KB Output is correct
2 Correct 2515 ms 415068 KB Output is correct
3 Correct 690 ms 121504 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 297628 KB Output is correct
2 Runtime error 1356 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 297368 KB Output is correct
2 Runtime error 1354 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 234856 KB Output is correct
2 Runtime error 1352 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -