Submission #681208

# Submission time Handle Problem Language Result Execution time Memory
681208 2023-01-12T14:25:37 Z Ninja_Kunai Mountains (NOI20_mountains) C++14
100 / 100
153 ms 14164 KB
/**
*    Author :  Nguyen Tuan Vu
*    Created : 12.01.2023
**/

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define MASK(x) ((1ll)<<(x))
#define BIT(x, i) (((x)>>(i))&(1))
#define ALL(v)  (v).begin(), (v).end()
#define REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)
#define db(val) "["#val" = "<<(val)<<"] "
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l, int r) {return l + rng() % (r - l + 1);}

void file(){
    #define TASK "XYZ"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
}

const int N = 3e5 + 5;
int n, L[N], R[N];
long long a[N];

struct Fenwick_Tree {
    vector <int> bit;
    int n;

    Fenwick_Tree (int n){
        this->n = n;
        bit.resize(n + 7, 0);
    }

    void update(int u, int val) {
        for (; u <= n; u += u & -u) bit[u] += val;
    }

    int get(int u) {
        int ans = 0;
        for (; u; u -= u & -u) ans += bit[u];
        return ans;
    }
};

void COUNT(int cnt[]) {
    Fenwick_Tree mybit(n);
    FOR(i, 1, n) {
        cnt[i] = mybit.get(a[i] - 1);
        mybit.update(a[i], 1);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    file();
    vector <long long> coor;
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i];
        coor.push_back(a[i]);
    }

    sort (ALL(coor));
    coor.erase(unique(ALL(coor)), coor.end());
    FOR(i, 1, n) a[i] = lower_bound(ALL(coor), a[i]) - coor.begin() + 1;
    COUNT(L);
    reverse(a + 1, a + n + 1);
    COUNT(R);

    long long ans = 0;
    FOR(i, 1, n) ans += 1ll * L[i] * R[n - i + 1];
    cout << ans;
    cerr << "Time elapsed: " << TIME << " s.\n";
    return 0;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/
/*
⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡎⣿⢾⡿⣿⡆⢸⣽⢻⣄⠹⣷⣟⣿⣄⠹⣟⣿⣿⣟⣿⣿⣿⣿⣿⣿⣽⣿⣿⣿⡇⢸⣯⣟⣧⠘⣷⠈⡯⠛⢀⡐⢾⣟⣷⣻⣿⣿⣿⡿⡌⢿⣻⣿⣿
⣿⣿⣿⣿⣿⣿⣧⢸⡿⣟⣿⡇⢸⣯⣟⣮⢧⡈⢿⣞⡿⣦⠘⠏⣹⣿⣽⢿⣿⣿⣿⣿⣯⣿⣿⣿⡇⢸⣿⣿⣾⡆⠹⢀⣠⣾⣟⣷⡈⢿⣞⣯⢿⣿⣿⣿⢷⠘⣯⣿⣿
⣿⣿⣿⣿⣿⣿⣿⡈⣿⢿⣽⡇⠘⠛⠛⠛⠓⠓⠈⠛⠛⠟⠇⢀⢿⣻⣿⣯⢿⣿⣿⣿⣷⢿⣿⣿⠁⣾⣿⣿⣿⣧⡄⠇⣹⣿⣾⣯⣿⡄⠻⣽⣯⢿⣻⣿⣿⡇⢹⣾⣿
⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⡽⡇⢸⣿⣿⣿⣿⣿⣞⣆⠰⣶⣶⡄⢀⢻⡿⣯⣿⡽⣿⣿⣿⢯⣟⡿⢀⣿⣿⣿⣿⣿⣧⠐⣸⣿⣿⣷⣿⣿⣆⠹⣯⣿⣻⣿⣿⣿⢀⣿⢿
⣿⣿⣿⣿⣿⣿⣿⣿⠘⣯⡿⡇⢸⣿⣿⣿⣿⣿⣿⣿⣧⡈⢿⣳⠘⡄⠻⣿⢾⣽⣟⡿⣿⢯⣿⡇⢸⣿⣿⣿⣿⣿⣿⡀⢾⣿⣿⣿⣿⣿⣿⣆⠹⣾⣷⣻⣿⡿⡇⢸⣿
⣿⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⠇⢸⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠻⡇⢹⣆⠹⣟⣾⣽⣻⣟⣿⣽⠁⣾⣿⣿⣿⣿⣿⣿⣇⣿⣿⠿⠛⠛⠉⠙⠋⢀⠁⢘⣯⣿⣿⣧⠘⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⡈⣿⡃⢼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⡙⠌⣿⣆⠘⣿⣞⡿⣞⡿⡞⢠⣿⣿⣿⣿⣿⡿⠛⠉⠁⢀⣀⣠⣤⣤⣶⣶⣶⡆⢻⣽⣞⡿⣷⠈⣿
⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠘⠁⠉⠉⠉⠉⠉⠉⠉⠉⠉⠙⠛⠛⢿⣄⢻⣿⣧⠘⢯⣟⡿⣽⠁⣾⣿⣿⣿⣿⣿⡃⢀⢀⠘⠛⠿⢿⣻⣟⣯⣽⣻⣵⡀⢿⣯⣟⣿⢀⣿
⣿⣿⣿⣟⣿⣿⣿⣿⣶⣶⡆⢀⣿⣾⣿⣾⣷⣿⣶⠿⠚⠉⢀⢀⣤⣿⣷⣿⣿⣷⡈⢿⣻⢃⣼⣿⣿⣿⣿⣻⣿⣿⣿⡶⣦⣤⣄⣀⡀⠉⠛⠛⠷⣯⣳⠈⣾⡽⣾⢀⣿
⣿⢿⣿⣿⣻⣿⣿⣿⣿⣿⡿⠐⣿⣿⣿⣿⠿⠋⠁⢀⢀⣤⣾⣿⣿⣿⣿⣿⣿⣿⣿⣌⣥⣾⡿⣿⣿⣷⣿⣿⢿⣷⣿⣿⣟⣾⣽⣳⢯⣟⣶⣦⣤⡾⣟⣦⠘⣿⢾⡁⢺
⣿⣻⣿⣿⡷⣿⣿⣿⣿⣿⡗⣦⠸⡿⠋⠁⢀⢀⣠⣴⢿⣿⣽⣻⢽⣾⣟⣷⣿⣟⣿⣿⣿⣳⠿⣵⣧⣼⣿⣿⣿⣿⣿⣾⣿⣿⣿⣿⣿⣽⣳⣯⣿⣿⣿⣽⢀⢷⣻⠄⠘
⣿⢷⣻⣿⣿⣷⣻⣿⣿⣿⡷⠛⣁⢀⣀⣤⣶⣿⣛⡿⣿⣮⣽⡻⣿⣮⣽⣻⢯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣯⢀⢸⣿⢀⡆
⠸⣟⣯⣿⣿⣷⢿⣽⣿⣿⣷⣿⣷⣆⠹⣿⣶⣯⠿⣿⣶⣟⣻⢿⣷⣽⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢀⣯⣟⢀⡇
⣇⠹⣟⣾⣻⣿⣿⢾⡽⣿⣿⣿⣿⣿⣆⢹⣶⣿⣻⣷⣯⣟⣿⣿⣽⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⢀⡿⡇⢸⡇
⣿⣆⠹⣷⡻⣽⣿⣯⢿⣽⣻⣿⣿⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠇⢸⣿⠇⣼⡇
⡙⠾⣆⠹⣿⣦⠛⣿⢯⣷⢿⡽⣿⣿⣿⣿⣆⠻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠃⠎⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠏⢀⣿⣾⣣⡿⡇
⣿⣷⡌⢦⠙⣿⣿⣌⠻⣽⢯⣿⣽⣻⣿⣿⣿⣧⠩⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⢰⢣⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⢀⢀⢿⣞⣷⢿⡇
⣿⣽⣆⠹⣧⠘⣿⣿⡷⣌⠙⢷⣯⡷⣟⣿⣿⣿⣷⡀⡹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣈⠃⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢀⣴⡧⢀⠸⣿⡽⣿⢀
⢻⣽⣿⡄⢻⣷⡈⢿⣿⣿⢧⢀⠙⢿⣻⡾⣽⣻⣿⣿⣄⠌⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢁⣰⣾⣟⡿⢀⡄⢿⣟⣿⢀
⡄⢿⣿⣷⢀⠹⣟⣆⠻⣿⣿⣆⢀⣀⠉⠻⣿⡽⣯⣿⣿⣷⣈⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⢀⣠⠘⣯⣷⣿⡟⢀⢆⠸⣿⡟⢸
⣷⡈⢿⣿⣇⢱⡘⢿⣷⣬⣙⠿⣧⠘⣆⢀⠈⠻⣷⣟⣾⢿⣿⣆⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⣠⡞⢡⣿⢀⣿⣿⣿⠇⡄⢸⡄⢻⡇⣼
⣿⣷⡈⢿⣿⡆⢣⡀⠙⢾⣟⣿⣿⣷⡈⠂⠘⣦⡈⠿⣯⣿⢾⣿⣆⠙⠻⠿⠿⠿⠿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠛⢋⣠⣾⡟⢠⣿⣿⢀⣿⣿⡟⢠⣿⢈⣧⠘⢠⣿
⣿⣿⣿⣄⠻⣿⡄⢳⡄⢆⡙⠾⣽⣿⣿⣆⡀⢹⡷⣄⠙⢿⣿⡾⣿⣆⢀⡀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⣀⣠⣴⡿⣯⠏⣠⣿⣿⡏⢸⣿⡿⢁⣿⣿⢀⣿⠆⢸⣿
⣿⣿⣿⣿⣦⡙⣿⣆⢻⡌⢿⣶⢤⣉⣙⣿⣷⡀⠙⠽⠷⠄⠹⣿⣟⣿⣆⢙⣋⣤⣤⣤⣄⣀⢀⢀⢀⢀⣾⣿⣟⡷⣯⡿⢃⣼⣿⣿⣿⠇⣼⡟⣡⣿⣿⣿⢀⡿⢠⠈⣿
⣿⣿⣿⣿⣿⣷⣮⣿⣿⣿⡌⠁⢤⣤⣤⣤⣬⣭⣴⣶⣶⣶⣆⠈⢻⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣷⣶⣤⣌⣉⡘⠛⠻⠶⣿⣿⣿⣿⡟⣰⣫⣴⣿⣿⣿⣿⠄⣷⣿⣿⣿
*/

Compilation message

Mountains.cpp: In function 'void file()':
Mountains.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Mountains.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 89 ms 14060 KB Output is correct
3 Correct 92 ms 14008 KB Output is correct
4 Correct 86 ms 14008 KB Output is correct
5 Correct 106 ms 14004 KB Output is correct
6 Correct 88 ms 14028 KB Output is correct
7 Correct 89 ms 13992 KB Output is correct
8 Correct 89 ms 14164 KB Output is correct
9 Correct 87 ms 14072 KB Output is correct
10 Correct 92 ms 14020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 55 ms 9020 KB Output is correct
2 Correct 52 ms 9096 KB Output is correct
3 Correct 51 ms 9140 KB Output is correct
4 Correct 59 ms 9040 KB Output is correct
5 Correct 52 ms 9124 KB Output is correct
6 Correct 53 ms 9072 KB Output is correct
7 Correct 66 ms 9124 KB Output is correct
8 Correct 46 ms 9056 KB Output is correct
9 Correct 46 ms 9124 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 55 ms 9020 KB Output is correct
2 Correct 52 ms 9096 KB Output is correct
3 Correct 51 ms 9140 KB Output is correct
4 Correct 59 ms 9040 KB Output is correct
5 Correct 52 ms 9124 KB Output is correct
6 Correct 53 ms 9072 KB Output is correct
7 Correct 66 ms 9124 KB Output is correct
8 Correct 46 ms 9056 KB Output is correct
9 Correct 46 ms 9124 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 66 ms 9332 KB Output is correct
12 Correct 63 ms 9408 KB Output is correct
13 Correct 72 ms 9328 KB Output is correct
14 Correct 88 ms 9380 KB Output is correct
15 Correct 64 ms 9340 KB Output is correct
16 Correct 63 ms 9340 KB Output is correct
17 Correct 67 ms 9336 KB Output is correct
18 Correct 48 ms 9328 KB Output is correct
19 Correct 58 ms 9304 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 5 ms 808 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 7 ms 800 KB Output is correct
14 Correct 7 ms 800 KB Output is correct
15 Correct 4 ms 808 KB Output is correct
16 Correct 4 ms 840 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 55 ms 9020 KB Output is correct
2 Correct 52 ms 9096 KB Output is correct
3 Correct 51 ms 9140 KB Output is correct
4 Correct 59 ms 9040 KB Output is correct
5 Correct 52 ms 9124 KB Output is correct
6 Correct 53 ms 9072 KB Output is correct
7 Correct 66 ms 9124 KB Output is correct
8 Correct 46 ms 9056 KB Output is correct
9 Correct 46 ms 9124 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 66 ms 9332 KB Output is correct
12 Correct 63 ms 9408 KB Output is correct
13 Correct 72 ms 9328 KB Output is correct
14 Correct 88 ms 9380 KB Output is correct
15 Correct 64 ms 9340 KB Output is correct
16 Correct 63 ms 9340 KB Output is correct
17 Correct 67 ms 9336 KB Output is correct
18 Correct 48 ms 9328 KB Output is correct
19 Correct 58 ms 9304 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 111 ms 10168 KB Output is correct
22 Correct 111 ms 10212 KB Output is correct
23 Correct 109 ms 10212 KB Output is correct
24 Correct 104 ms 10188 KB Output is correct
25 Correct 103 ms 10168 KB Output is correct
26 Correct 104 ms 10168 KB Output is correct
27 Correct 102 ms 10192 KB Output is correct
28 Correct 57 ms 10208 KB Output is correct
29 Correct 57 ms 10180 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 89 ms 14060 KB Output is correct
3 Correct 92 ms 14008 KB Output is correct
4 Correct 86 ms 14008 KB Output is correct
5 Correct 106 ms 14004 KB Output is correct
6 Correct 88 ms 14028 KB Output is correct
7 Correct 89 ms 13992 KB Output is correct
8 Correct 89 ms 14164 KB Output is correct
9 Correct 87 ms 14072 KB Output is correct
10 Correct 92 ms 14020 KB Output is correct
11 Correct 55 ms 9020 KB Output is correct
12 Correct 52 ms 9096 KB Output is correct
13 Correct 51 ms 9140 KB Output is correct
14 Correct 59 ms 9040 KB Output is correct
15 Correct 52 ms 9124 KB Output is correct
16 Correct 53 ms 9072 KB Output is correct
17 Correct 66 ms 9124 KB Output is correct
18 Correct 46 ms 9056 KB Output is correct
19 Correct 46 ms 9124 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 66 ms 9332 KB Output is correct
22 Correct 63 ms 9408 KB Output is correct
23 Correct 72 ms 9328 KB Output is correct
24 Correct 88 ms 9380 KB Output is correct
25 Correct 64 ms 9340 KB Output is correct
26 Correct 63 ms 9340 KB Output is correct
27 Correct 67 ms 9336 KB Output is correct
28 Correct 48 ms 9328 KB Output is correct
29 Correct 58 ms 9304 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 808 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 7 ms 800 KB Output is correct
44 Correct 7 ms 800 KB Output is correct
45 Correct 4 ms 808 KB Output is correct
46 Correct 4 ms 840 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 5 ms 852 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 111 ms 10168 KB Output is correct
52 Correct 111 ms 10212 KB Output is correct
53 Correct 109 ms 10212 KB Output is correct
54 Correct 104 ms 10188 KB Output is correct
55 Correct 103 ms 10168 KB Output is correct
56 Correct 104 ms 10168 KB Output is correct
57 Correct 102 ms 10192 KB Output is correct
58 Correct 57 ms 10208 KB Output is correct
59 Correct 57 ms 10180 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 137 ms 14024 KB Output is correct
62 Correct 137 ms 14012 KB Output is correct
63 Correct 140 ms 14072 KB Output is correct
64 Correct 137 ms 14044 KB Output is correct
65 Correct 137 ms 14024 KB Output is correct
66 Correct 153 ms 14092 KB Output is correct
67 Correct 142 ms 14036 KB Output is correct
68 Correct 137 ms 14008 KB Output is correct
69 Correct 108 ms 10328 KB Output is correct
70 Correct 1 ms 340 KB Output is correct