oj.uz

Submission #696599

# Submission time Handle Problem Language Result Execution time Memory
696599 2023-02-07T01:01:33 Z CDuong Autići (COCI22_autici) C++17
50 / 50
 12 ms 468 KB 
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
using namespace std;

const int mxN = 3e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n;
ll miin, sum;

void solve() {
    cin >> n;
    miin = oo;
    if(n == 1) {
        cout << 0 << endl;
        return;
    }
    for(int i = 1; i <= n; ++i) {
        ll tmp; cin >> tmp;
        sum += tmp;
        miin = min(miin, tmp);
    }
    sum += miin * (ll)(n - 2);
    cout << sum << endl;
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 11 ms 324 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 10 ms 440 KB Output is correct
6 Correct 8 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 11 ms 324 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 10 ms 440 KB Output is correct
6 Correct 8 ms 332 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 12 ms 340 KB Output is correct
23 Correct 9 ms 340 KB Output is correct
24 Correct 9 ms 456 KB Output is correct
25 Correct 9 ms 340 KB Output is correct
26 Correct 10 ms 468 KB Output is correct
27 Correct 9 ms 444 KB Output is correct
28 Correct 8 ms 340 KB Output is correct
29 Correct 9 ms 324 KB Output is correct
30 Correct 11 ms 340 KB Output is correct