oj.uz

Submission #977538

# Submission time Handle Problem Language Result Execution time Memory
977538 2024-05-08T06:27:47 Z 8pete8 Sirni (COCI17_sirni) C++17
84 / 140
 1026 ms 786432 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
#include <cstdlib> 
#include <cstdint>
using namespace std;
#define ll long long
#define f first
//#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
//#define int long long
#define double long double
const int mxn=1e5,inf=1e9,minf=-1e9;
vector<int>v;
int p[mxn+10];
int mx=0;
int find(int u){return (p[u]==u)?u:p[u]=find(p[u]);}
bool merg(int a,int b){
	a=find(a),b=find(b);
	if(a==b)return 0;
	p[a]=b;
	return 1;
}
vector<pair<int,pii>>con;
int32_t main(){
	fastio
	int n;cin>>n;
	for(int i=0;i<n;i++){
		int a;cin>>a;
		mx=max(mx,a);
		v.pb(a);
	}
	for(int i=0;i<n;i++)p[i]=i;
	sort(all(v));
	ll ans=0;
	vector<int>bro(mx+1,-1);
	if(mx<10000000){
		v.erase(unique(all(v)),v.end());
		for(int i=0;i<v.size();i++){
			bro[v[i]]=i;
			if(i+1<v.size())con.pb({v[i+1]%v[i],{i,i+1}});
		}
		for(int i=mx-1;i>=0;i--)if(bro[i]==-1)bro[i]=bro[i+1];
		for(int i=0;i<v.size();i++){
			int x=v[i];
			for(int j=x;j<=mx+1;j+=x)if(v[bro[j]]!=inf)con.pb({v[bro[j]]%x,{i,bro[j]}});
		}
	}
	sort(all(con));
	int cnt=0;
	for(auto i:con)if(merg(i.s.f,i.s.s))ans+=(i.f),cnt++;
	if(cnt!=v.size()-1)assert(0);
	cout<<ans;
	return 0;
}
/*


*/

Compilation message

sirni.cpp: In function 'int32_t main()':
sirni.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for(int i=0;i<v.size();i++){
      |               ~^~~~~~~~~
sirni.cpp:67:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    if(i+1<v.size())con.pb({v[i+1]%v[i],{i,i+1}});
      |       ~~~^~~~~~~~~
sirni.cpp:70:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for(int i=0;i<v.size();i++){
      |               ~^~~~~~~~~
sirni.cpp:78:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  if(cnt!=v.size()-1)assert(0);
      |     ~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 39612 KB Output is correct
2 Correct 280 ms 89892 KB Output is correct
3 Correct 30 ms 39956 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 39764 KB Output is correct
2 Correct 29 ms 39668 KB Output is correct
3 Correct 29 ms 39764 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 31548 KB Output is correct
2 Correct 622 ms 105412 KB Output is correct
3 Correct 284 ms 55608 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7676 KB Output is correct
2 Correct 300 ms 56380 KB Output is correct
3 Correct 170 ms 28932 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 56112 KB Output is correct
2 Correct 805 ms 104800 KB Output is correct
3 Correct 258 ms 31476 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 8016 KB Output is correct
2 Correct 814 ms 103972 KB Output is correct
3 Correct 270 ms 56536 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 65472 KB Output is correct
2 Runtime error 732 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 283 ms 67188 KB Output is correct
2 Runtime error 722 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 63 ms 44292 KB Output is correct
2 Runtime error 1026 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -