Submission #715156

#	Time	Username	Problem	Language	Result	Execution time	Memory
715156		Ferid20072020	Sirni (COCI17_sirni)	C++14	0 / 140	14 ms	1876 KiB

sirni

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

using namespace std;

#define ll          long long 
#define ull         unsigned long long 
#define ld          long double 
#define ui          unsigned int 
#define f           first
#define s           second
#define ins         insert
#define pb          push_back
#define mp          make_pair
#define ln          '\n'
#define int         ll
#define pii         pair<int , int> 
#define INF         LLONG_MAX
#define vv(a)       vector<a>
#define pp(a, b)    pair<a, b>
#define pq(a)       priority_queue<a>
#define qq(a)       queue<a>
#define ss(a)       set<a>
#define mss(a)      multiset<a>
#define mm(a, b)    map<a, b>
#define mmm(a , b)  multimap<a , b>
#define sz(x)       (x).size()
#define all(x)      (x).begin() , (x).end()
#define fastio                    \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

void solve(){
    int n;
    cin >> n;
    vv(int) a(n);
    for(int i=0 ; i<n ; i++){
        cin >> a[i];
    }
    if(n <= 1000){
        int ans = 0;
        set<int> ch;
        for(int i=0 ; i<n ; i++){
            int Min = 1e9 , num;
            if(ch.count(a[i])){
                continue;
            }
            for(int j=0 ; j<n ; j++){
                if(i != j){
                    if(Min > min(a[i]%a[j] , a[j]%a[i])){
                        Min = min(a[i]%a[j] , a[j]%a[i]);
                        num = a[j];
                    }
                }
            }
            ch.ins(num);
            ch.ins(a[i]);
            ans += Min;
        }
        cout << ans << ln;
    }
}


signed main(){
    fastio

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14