Submission #429596

# Submission time Handle Problem Language Result Execution time Memory
429596 2021-06-16T07:31:50 Z 반딧불(#7598) GCD-sum (CPSPC17_gcds) C++17
13 / 100
2000 ms 271648 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct dat{
    int x, y; ll v;
    dat(){}
    dat(int x, int y, ll v): x(x), y(y), v(v){}

    bool operator<(const dat &r)const{
        return v > r.v;
    }
};

int n;
ll arr[500002];
ll ans[500002];
ll sum;
priority_queue<dat> pq;
bool finish[500002];

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++) scanf("%lld", &arr[i]);
    sum = accumulate(arr+1, arr+n+1, 0LL);
    ans[n] = sum;

    for(int i=1; i<=n; i++){
        for(int j=i+1; j<=n; j++){
            pq.push(dat(i, j, arr[i] + arr[j] - __gcd(arr[i], arr[j])));
        }
    }

    for(int turn=n-1; turn>=1; turn--){
        while(finish[pq.top().x] || finish[pq.top().y]) pq.pop();
        dat tmp = pq.top(); pq.pop();
        sum -= tmp.v;
        ans[turn] = sum;

        finish[tmp.x] = finish[tmp.y] = 1;
        arr[++n] = __gcd(arr[tmp.x], arr[tmp.y]);
        arr[tmp.x] = arr[tmp.y] = 0;
        for(int i=1; i<n; i++){
            if(finish[i]) continue;
            pq.push(dat(i, n, arr[i] + arr[n] - __gcd(arr[i], arr[n])));
        }
    }

    for(int i=1; i<=(n+1)/2; i++) printf("%lld\n", ans[i]);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:26:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     for(int i=1; i<=n; i++) scanf("%lld", &arr[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB Output isn't correct
23 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Incorrect 2 ms 588 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 439 ms 33244 KB Output is correct
2 Correct 500 ms 33224 KB Output is correct
3 Correct 470 ms 33188 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 291 ms 16772 KB Output is correct
6 Correct 475 ms 33284 KB Output is correct
7 Correct 447 ms 33416 KB Output is correct
8 Correct 454 ms 33288 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 270 ms 16840 KB Output is correct
11 Correct 483 ms 33284 KB Output is correct
12 Correct 458 ms 33284 KB Output is correct
13 Correct 520 ms 33288 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 270 ms 16788 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 870 ms 66144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB Output isn't correct
23 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 439 ms 33244 KB Output is correct
2 Correct 500 ms 33224 KB Output is correct
3 Correct 470 ms 33188 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 291 ms 16772 KB Output is correct
6 Correct 475 ms 33284 KB Output is correct
7 Correct 447 ms 33416 KB Output is correct
8 Correct 454 ms 33288 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 270 ms 16840 KB Output is correct
11 Correct 483 ms 33284 KB Output is correct
12 Correct 458 ms 33284 KB Output is correct
13 Correct 520 ms 33288 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 270 ms 16788 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 870 ms 66144 KB Output is correct
22 Execution timed out 2085 ms 271648 KB Time limit exceeded
23 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB Output isn't correct
23 Halted 0 ms 0 KB -