| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 888860 |
2023-12-18T09:44:38 Z |
asdasdqwer |
Sirni (COCI17_sirni) |
C++14 |
|
5000 ms |
576080 KB |
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,sse4")
#include <bits/stdc++.h>
using namespace std;
struct DSU {
vector<int32_t> p, r;
DSU(int32_t n) {
p.assign(n,0);
r.assign(n,1);
for (int i=0;i<n;i++)p[i]=i;
}
int get(int32_t i) {
if (i != p[i]) p[i]=get(p[i]);
return p[i];
}
bool unite(int32_t a,int32_t b) {
// assert(a < p.size() && b < p.size());
a=get(a);
b=get(b);
if (a==b)return false;
if (r[a]<r[b])swap(a,b);
p[b]=a;
r[a]+=r[b];
return true;
}
};
signed test(int n, vector<int> b) {
vector<int32_t> clos(b.back()+1,-1);
for (int32_t x:b) {
clos[x]=x;
}
for (int32_t i=clos.size()-2;i>=0;i--) {
if (clos[i] == -1) {
clos[i]=clos[i+1];
}
}
// cout<<"here\n";
typedef array<int32_t,2> pii;
vector<vector<pii>> edg(b.back()+1);
for (int32_t x:b) {
// cout<<x<<"\n";
vector<int> tmp;
if (x != b.back()) {
edg[clos[x+1]%x].push_back({x, clos[x+1]});
}
// cout<<"after\n";
for (int32_t j=2*x;j<=b.back();j+=x) {
// cout<<j<<" "<<clos[j]<<"\n";
if (clos[j] != -1) {
if (tmp.size() == 0) {
edg[clos[j]%x].push_back({clos[j], x});
tmp.push_back(clos[j]);
}
else if (tmp.back() != clos[j]) {
edg[clos[j]%x].push_back({clos[j], x});
tmp.push_back(clos[j]);
}
}
}
if (tmp.size() == 0 || tmp.back() != b.back()) {
edg[b.back()%x].push_back({b.back(), x});
}
}
// cout<<edg.size()<<"\n";
map<int,int> mp;
for (int i=0;i<b.size();i++) {
mp[b[i]]=i;
}
for (auto &x:edg) {
// cout<<x[1]<<" "<<x[2]<<"\n";
for (auto &y:x) {
y[0]=mp[y[0]];
y[1]=mp[y[1]];
}
}
// cout<<"\n";
DSU d(b.size());
int cost=0;
int steps=0;
bool term=false;
for (int c=0;c<=b.back();c++) {
for (auto &x:edg[c]) {
if (d.unite(x[0], x[1])) {
cost+=c;
steps++;
if (steps == n-1) {
term=true;
break;
}
}
}
if (term)break;
}
return cost;
}
bool brute() {
int len=(rand() % 2000)+2000;
vector<int> b;
set<int> chose;
for (int i=0;i<len;i++) {
int j=(rand()%100000)+1;
while (chose.find(j) != chose.end()) {
j=(rand()%100000)+1;
}
chose.insert(j);
b.push_back(j);
}
cout<<"gen numbers\n";
sort(b.begin(),b.end());
typedef array<int,3> pii;
vector<pii> g;
for (int i=0;i<len;i++) {
for (int j=i+1;j<len;j++) {
g.push_back({b[j] % b[i], j, i});
}
}
sort(g.begin(),g.end());
DSU d(len);
int cost=0;
for (auto x:g) {
if (d.unite(x[1], x[2])) {
// cout<<b[x[1]]<<" "<<b[x[2]]<<"\n";
cost += x[0];
}
}
cout<<"mst calc\n";
// cout<<"\n";
int cost2 = test(len, b);
cout<<"mst fast\n";
// cout<<"\n";
if (cost != cost2) {
cout<<cost<<" "<<cost2<<"\n";
}
// for (int x:b) {
// cout<<x<<" ";
// }
// cout<<"\n";
cout<<"finished\n";
cout.flush();
return true;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<int> a(n);
for (int &x:a)cin>>x;
if (n == 1) {
cout<<0<<"\n";
return 0;
}
sort(a.begin(),a.end());
vector<int> b;
for (int x:a) {
if (b.size()==0||b.back()!=x)b.push_back(x);
}
cout<<test(n,b)<<"\n";
// brute();
}
Compilation message
sirni.cpp: In function 'int test(int, std::vector<int>)':
sirni.cpp:80:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
80 | for (int i=0;i<b.size();i++) {
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
118 ms |
274260 KB |
Output is correct |
| 2 |
Correct |
170 ms |
275792 KB |
Output is correct |
| 3 |
Correct |
106 ms |
273524 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
860 KB |
Output is correct |
| 2 |
Correct |
355 ms |
274588 KB |
Output is correct |
| 3 |
Correct |
129 ms |
274872 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
104 ms |
274512 KB |
Output is correct |
| 2 |
Correct |
119 ms |
274000 KB |
Output is correct |
| 3 |
Correct |
97 ms |
274624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
300 ms |
45316 KB |
Output is correct |
| 2 |
Correct |
858 ms |
70292 KB |
Output is correct |
| 3 |
Correct |
353 ms |
48164 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
30652 KB |
Output is correct |
| 2 |
Correct |
373 ms |
50420 KB |
Output is correct |
| 3 |
Correct |
275 ms |
30388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
627 ms |
56228 KB |
Output is correct |
| 2 |
Correct |
1065 ms |
86544 KB |
Output is correct |
| 3 |
Correct |
348 ms |
48408 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
86 ms |
12084 KB |
Output is correct |
| 2 |
Correct |
953 ms |
77712 KB |
Output is correct |
| 3 |
Correct |
348 ms |
47048 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
541 ms |
295400 KB |
Output is correct |
| 2 |
Execution timed out |
5036 ms |
492620 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
547 ms |
295532 KB |
Output is correct |
| 2 |
Execution timed out |
5071 ms |
576080 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
182 ms |
278480 KB |
Output is correct |
| 2 |
Execution timed out |
5057 ms |
571884 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
