oj.uz

답안 #887160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887160 2023-12-13T23:01:52 Z Servant_of_the_Lord Sirni (COCI17_sirni) C++17
98 / 140
 5000 ms 607848 KB 
    #include <bits/stdc++.h>
    #pragma GCC optimize("Ofast")
    #pragma GCC target("avx,avx2,sse4")
    #define ll long long
     
    using namespace std;
     
    main()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(0);
     
        ll x,y,z,a,b,c;
        cin>>x;
        set<pair<ll,ll>>s;
        for(ll i=0;i<x;i++)
        {
            cin>>y;
            s.insert({y,i});
        }
        array<vector<ll>,10'000'000>v;
        for(pair<ll,ll> i:s)
        {
            if(v[i.first-1].empty())
            {
                for(ll j=i.first-1;j<10'000'000;j+=i.first)
                {
                    v[j].push_back(i.second);
                }
            }
        }
        vector<ll>w(x,-1);
        function<ll(ll)>g=[&](ll a){return w[a]<0?a:w[a]=g(w[a]);};
        function<bool(ll,ll)>u=[&](ll a,ll b)
        {
            a=g(a),b=g(b);
            if(a==b)return false;
            if(w[a]>w[b])swap(a,b);
            w[a]+=w[b];
            w[b]=a;
            return true;
        };
        a=0;
        bitset<10'000'000>t;
        for(ll i=0;i<10'000'000;i++)
        {
            vector<pair<ll,ll>>e;
            for(pair<ll,ll> j:s)
            {
                for(ll k=0;k<v[j.first-i-1].size();k++)
                {
                    if(u(j.second,v[j.first-i-1][k]))
                    {
                        a+=i;
                    }
                }
                if(j.first-i-1==0||t[j.first-i-1])e.push_back(j);
                t[j.first-i-1]=1;
            }
            for(auto j:e)s.erase(j);
            if(s.empty())break;
        }
        cout<<a<<'\n';
    }

Compilation message

sirni.cpp:8:5: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    8 |     main()
      |     ^~~~
sirni.cpp: In function 'int main()':
sirni.cpp:50:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |                 for(ll k=0;k<v[j.first-i-1].size();k++)
      |                            ~^~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:13:16: warning: unused variable 'z' [-Wunused-variable]
   13 |         ll x,y,z,a,b,c;
      |                ^
sirni.cpp:13:20: warning: unused variable 'b' [-Wunused-variable]
   13 |         ll x,y,z,a,b,c;
      |                    ^
sirni.cpp:13:22: warning: unused variable 'c' [-Wunused-variable]
   13 |         ll x,y,z,a,b,c;
      |                      ^

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 664 ms 236716 KB Output is correct
2 Correct 1498 ms 299576 KB Output is correct
3 Correct 665 ms 237396 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 877 ms 372344 KB Output is correct
2 Correct 3366 ms 583896 KB Output is correct
3 Correct 686 ms 238588 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 663 ms 236560 KB Output is correct
2 Correct 404 ms 236620 KB Output is correct
3 Correct 673 ms 236884 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1665 ms 404260 KB Output is correct
2 Correct 2666 ms 546432 KB Output is correct
3 Correct 2846 ms 593752 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 503 ms 284420 KB Output is correct
2 Correct 2592 ms 435748 KB Output is correct
3 Correct 2392 ms 504856 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2524 ms 471924 KB Output is correct
2 Correct 2711 ms 607616 KB Output is correct
3 Correct 1900 ms 499440 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1784 ms 456996 KB Output is correct
2 Correct 3015 ms 607848 KB Output is correct
3 Correct 2502 ms 570076 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1782 ms 279892 KB Output is correct
2 Execution timed out 5100 ms 553952 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1829 ms 291752 KB Output is correct
2 Execution timed out 5043 ms 599908 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 937 ms 243632 KB Output is correct
2 Execution timed out 5054 ms 502812 KB Time limit exceeded
3 Halted 0 ms 0 KB -