oj.uz

Submission #570238

# Submission time Handle Problem Language Result Execution time Memory
570238 2022-05-28T21:32:45 Z Joshi503 Mountains (NOI20_mountains) C++14
15 / 100
 231 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define f first
#define s second

#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;

#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define pb push_back

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)

const ll MOD = 1e9 + 7;
const ll MX = 1e9;
const ll INF = 1e18;
const db PI = acos((db)-1);
const int ddef[4]{ 1,0,-1,0 }, dataq[4]{ 0,1,0,-1 };
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (sz(name)) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}

void _print(char i) { cerr << i; }
void _print(string i) { cerr << i; }
void _print(float i) { cerr << i; }
void _print(int i) { cerr << i; }
void _print(double i) { cerr << i; }
void _print() { cerr << "\n"; };
template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; }
template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; }
template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); }
#define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n";

int test;

void solve() {

    ll n; cin >> n;

    vi a(n);
    each(x, a) cin >> x;
    vi b = a;
    sor(b);
    if(a == b){
        cout << "0\n";
        return;
    }
    if(n <= 10000){
        ll ans = 0;
        F0R(i, n){
            ll cnt1 = 0, cnt2 = 0;
            F0R(j, i){
                cnt1 += (a[i] > a[j]);
            }
            for(ll j = i + 1; j < n; j++){
                cnt2 += (a[i] > a[j]);
            }
            ans += cnt1 * cnt2;
        }
        cout << ans << "\n";
        return;
    }
    map<ll, ll> m;
    ll cnt = 0;
    F0R(i, n){
        if(!m[b[i]]){
            m[b[i]] = cnt++;
        }
    }
    ll pref[n + 1][cnt];
    F0R(i, n){
        a[i] = m[a[i]];
    }
    F0R(i, n + 1){
        F0R(j, cnt){
            pref[i][j] = 0;
        }
    }
    for(ll i = 0; i < n; i++){
        for(ll j = 0; j < cnt; j++){
            pref[i + 1][j] = pref[i][j] + (j > a[i]);
        }
    }
    ll ans = 0;
    FOR(i, 1, n - 1){
        // cout << pref[i][a[i]] - pref[i - 1][a[i]] << " " << pref[n][a[i]] - pref[i][a[i]] << "\n";
        ans += (pref[i][a[i]]) * (pref[n][a[i]] - pref[i + 1][a[i]]);
    }
    for(ll j = 0; j < cnt; j++){
        for(ll i = 0; i < n + 1; i++){
        }
    } 

    cout << ans << "\n";
 
}

int main() {
    setIO("");
    int T = 1;
    // cin >> T;
    for (test = 1; test <= T; test++) solve();
    return 0;
}

Compilation message

Mountains.cpp: In function 'void setIO(std::string)':
Mountains.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mountains.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 9800 KB Output is correct
3 Correct 16 ms 9684 KB Output is correct
4 Correct 21 ms 9684 KB Output is correct
5 Correct 20 ms 9728 KB Output is correct
6 Correct 17 ms 9636 KB Output is correct
7 Correct 17 ms 9724 KB Output is correct
8 Correct 18 ms 9684 KB Output is correct
9 Correct 15 ms 9596 KB Output is correct
10 Correct 15 ms 9684 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 9692 KB Output is correct
2 Correct 33 ms 9600 KB Output is correct
3 Correct 34 ms 9704 KB Output is correct
4 Correct 32 ms 9684 KB Output is correct
5 Correct 40 ms 9676 KB Output is correct
6 Correct 29 ms 9720 KB Output is correct
7 Correct 41 ms 9700 KB Output is correct
8 Correct 27 ms 2664 KB Output is correct
9 Correct 28 ms 2644 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 9692 KB Output is correct
2 Correct 33 ms 9600 KB Output is correct
3 Correct 34 ms 9704 KB Output is correct
4 Correct 32 ms 9684 KB Output is correct
5 Correct 40 ms 9676 KB Output is correct
6 Correct 29 ms 9720 KB Output is correct
7 Correct 41 ms 9700 KB Output is correct
8 Correct 27 ms 2664 KB Output is correct
9 Correct 28 ms 2644 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 216 ms 239840 KB Output is correct
12 Correct 204 ms 239820 KB Output is correct
13 Correct 217 ms 239768 KB Output is correct
14 Correct 212 ms 239732 KB Output is correct
15 Correct 205 ms 239788 KB Output is correct
16 Correct 204 ms 239840 KB Output is correct
17 Correct 231 ms 239856 KB Output is correct
18 Correct 21 ms 2644 KB Output is correct
19 Correct 19 ms 2588 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 9692 KB Output is correct
2 Correct 33 ms 9600 KB Output is correct
3 Correct 34 ms 9704 KB Output is correct
4 Correct 32 ms 9684 KB Output is correct
5 Correct 40 ms 9676 KB Output is correct
6 Correct 29 ms 9720 KB Output is correct
7 Correct 41 ms 9700 KB Output is correct
8 Correct 27 ms 2664 KB Output is correct
9 Correct 28 ms 2644 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 216 ms 239840 KB Output is correct
12 Correct 204 ms 239820 KB Output is correct
13 Correct 217 ms 239768 KB Output is correct
14 Correct 212 ms 239732 KB Output is correct
15 Correct 205 ms 239788 KB Output is correct
16 Correct 204 ms 239840 KB Output is correct
17 Correct 231 ms 239856 KB Output is correct
18 Correct 21 ms 2644 KB Output is correct
19 Correct 19 ms 2588 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Runtime error 215 ms 262144 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 9800 KB Output is correct
3 Correct 16 ms 9684 KB Output is correct
4 Correct 21 ms 9684 KB Output is correct
5 Correct 20 ms 9728 KB Output is correct
6 Correct 17 ms 9636 KB Output is correct
7 Correct 17 ms 9724 KB Output is correct
8 Correct 18 ms 9684 KB Output is correct
9 Correct 15 ms 9596 KB Output is correct
10 Correct 15 ms 9684 KB Output is correct
11 Correct 39 ms 9692 KB Output is correct
12 Correct 33 ms 9600 KB Output is correct
13 Correct 34 ms 9704 KB Output is correct
14 Correct 32 ms 9684 KB Output is correct
15 Correct 40 ms 9676 KB Output is correct
16 Correct 29 ms 9720 KB Output is correct
17 Correct 41 ms 9700 KB Output is correct
18 Correct 27 ms 2664 KB Output is correct
19 Correct 28 ms 2644 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 216 ms 239840 KB Output is correct
22 Correct 204 ms 239820 KB Output is correct
23 Correct 217 ms 239768 KB Output is correct
24 Correct 212 ms 239732 KB Output is correct
25 Correct 205 ms 239788 KB Output is correct
26 Correct 204 ms 239840 KB Output is correct
27 Correct 231 ms 239856 KB Output is correct
28 Correct 21 ms 2644 KB Output is correct
29 Correct 19 ms 2588 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Incorrect 1 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -