oj.uz

답안 #887161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887161 2023-12-13T23:03:30 Z Servant_of_the_Lord Sirni (COCI17_sirni) C++17
98 / 140
 5000 ms 607724 KB 
    #include <bits/stdc++.h>
    #pragma GCC optimize("O3")
    #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 389 ms 236792 KB Output is correct
2 Correct 1149 ms 299576 KB Output is correct
3 Correct 398 ms 237340 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1124 ms 372212 KB Output is correct
2 Correct 3355 ms 583684 KB Output is correct
3 Correct 404 ms 238544 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 236880 KB Output is correct
2 Correct 277 ms 236628 KB Output is correct
3 Correct 393 ms 236888 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1859 ms 403932 KB Output is correct
2 Correct 3122 ms 545560 KB Output is correct
3 Correct 3066 ms 593080 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 284500 KB Output is correct
2 Correct 2576 ms 435644 KB Output is correct
3 Correct 2759 ms 504560 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2778 ms 471324 KB Output is correct
2 Correct 2881 ms 607724 KB Output is correct
3 Correct 1892 ms 499316 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1968 ms 457104 KB Output is correct
2 Correct 3349 ms 607456 KB Output is correct
3 Correct 2637 ms 569768 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1248 ms 279888 KB Output is correct
2 Execution timed out 5130 ms 553944 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1323 ms 291784 KB Output is correct
2 Execution timed out 5070 ms 600244 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 582 ms 243540 KB Output is correct
2 Execution timed out 5127 ms 502612 KB Time limit exceeded
3 Halted 0 ms 0 KB -