oj.uz

Submission #1004681

# Submission time Handle Problem Language Result Execution time Memory
1004681 2024-06-21T12:27:09 Z vjudge1 Autići (COCI22_autici) C++17
50 / 50
 13 ms 2220 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX     100005
int numNode;
int D[MAX];
void process(void){
    cin >> numNode;
    for (int i = 1; i <= numNode; ++i) cin >> D[i];
    sort(D + 1, D + numNode + 1);
    int ans = 0;
    for (int i = 2; i <= numNode; ++i) ans += D[i] + D[1];
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);

    process();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 9 ms 2212 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 8 ms 2220 KB Output is correct
6 Correct 10 ms 1880 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 9 ms 2212 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 8 ms 2220 KB Output is correct
6 Correct 10 ms 1880 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 5 ms 1392 KB Output is correct
22 Correct 9 ms 2140 KB Output is correct
23 Correct 8 ms 2140 KB Output is correct
24 Correct 12 ms 1924 KB Output is correct
25 Correct 13 ms 2136 KB Output is correct
26 Correct 12 ms 1884 KB Output is correct
27 Correct 13 ms 2024 KB Output is correct
28 Correct 12 ms 2036 KB Output is correct
29 Correct 13 ms 2140 KB Output is correct
30 Correct 8 ms 2140 KB Output is correct