oj.uz

Submission #526316

# Submission time Handle Problem Language Result Execution time Memory
526316 2022-02-14T09:29:23 Z Carmel_Ab1 Mountains (NOI20_mountains) C++17
100 / 100
 471 ms 29400 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
void compress(vl& a){
    vl s(a);
    sort(all(s));

    map<ll,ll>conv;
    int n=a.size();
    for(int i=0; i<n;i ++)
        conv[s[i]]=i;
    for(int i=0; i<n;i ++)
        a[i]=conv[a[i]];
}
struct seg{
    vl t;
    ll sz=1;
    seg(int n){
        sz=2*n;
        t.resize(sz);
    }
    void upd(ll i,ll v){
        t[i+=sz/2]+=v;
        while(i>1){
            t[i/2]=t[i]+t[i^1];
            i/=2;
        }
    }
    ll qur(ll l,ll r){
        ll ans=0;
        for(l+=sz/2,r+=sz/2 +1; l<r;l/=2,r/=2){
            if(l&1)ans+=t[l++];
            if(r&1)ans+=t[--r];
        }
        return ans;
    }
};

void solve() {
    ll n;
    cin >> n;
    vl a(n);
    read(a);

    compress(a);

    seg ST1(n+1),ST2(n+1);
    ll ans=0;

    for(int i=n-1; 0<=i; i--){
        ST2.upd(a[i],1);
        ST1.upd(a[i],ST2.qur(0,a[i]-1));
        ans+=ST1.qur(a[i]+1,n);
    }
    out(ans)
}

Compilation message

Mountains.cpp: In function 'void usaco(std::string)':
Mountains.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
Mountains.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 187 ms 23948 KB Output is correct
3 Correct 197 ms 24048 KB Output is correct
4 Correct 189 ms 24004 KB Output is correct
5 Correct 187 ms 24048 KB Output is correct
6 Correct 197 ms 23992 KB Output is correct
7 Correct 189 ms 24032 KB Output is correct
8 Correct 185 ms 24004 KB Output is correct
9 Correct 163 ms 14984 KB Output is correct
10 Correct 163 ms 14916 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 12232 KB Output is correct
2 Correct 49 ms 12564 KB Output is correct
3 Correct 54 ms 12592 KB Output is correct
4 Correct 50 ms 12588 KB Output is correct
5 Correct 49 ms 12564 KB Output is correct
6 Correct 51 ms 12580 KB Output is correct
7 Correct 50 ms 12564 KB Output is correct
8 Correct 44 ms 12596 KB Output is correct
9 Correct 43 ms 12636 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 12232 KB Output is correct
2 Correct 49 ms 12564 KB Output is correct
3 Correct 54 ms 12592 KB Output is correct
4 Correct 50 ms 12588 KB Output is correct
5 Correct 49 ms 12564 KB Output is correct
6 Correct 51 ms 12580 KB Output is correct
7 Correct 50 ms 12564 KB Output is correct
8 Correct 44 ms 12596 KB Output is correct
9 Correct 43 ms 12636 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 101 ms 13048 KB Output is correct
12 Correct 95 ms 12832 KB Output is correct
13 Correct 100 ms 12912 KB Output is correct
14 Correct 95 ms 12920 KB Output is correct
15 Correct 94 ms 12828 KB Output is correct
16 Correct 95 ms 12860 KB Output is correct
17 Correct 94 ms 12852 KB Output is correct
18 Correct 56 ms 12828 KB Output is correct
19 Correct 53 ms 12864 KB Output is correct
20 Correct 0 ms 312 KB Output is correct

Subtask #4
36.0 / 36.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 8 ms 1228 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 8 ms 1228 KB Output is correct
14 Correct 7 ms 1228 KB Output is correct
15 Correct 8 ms 1280 KB Output is correct
16 Correct 8 ms 1284 KB Output is correct
17 Correct 8 ms 1228 KB Output is correct
18 Correct 8 ms 840 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 12232 KB Output is correct
2 Correct 49 ms 12564 KB Output is correct
3 Correct 54 ms 12592 KB Output is correct
4 Correct 50 ms 12588 KB Output is correct
5 Correct 49 ms 12564 KB Output is correct
6 Correct 51 ms 12580 KB Output is correct
7 Correct 50 ms 12564 KB Output is correct
8 Correct 44 ms 12596 KB Output is correct
9 Correct 43 ms 12636 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 101 ms 13048 KB Output is correct
12 Correct 95 ms 12832 KB Output is correct
13 Correct 100 ms 12912 KB Output is correct
14 Correct 95 ms 12920 KB Output is correct
15 Correct 94 ms 12828 KB Output is correct
16 Correct 95 ms 12860 KB Output is correct
17 Correct 94 ms 12852 KB Output is correct
18 Correct 56 ms 12828 KB Output is correct
19 Correct 53 ms 12864 KB Output is correct
20 Correct 0 ms 312 KB Output is correct
21 Correct 287 ms 14996 KB Output is correct
22 Correct 269 ms 15016 KB Output is correct
23 Correct 271 ms 15012 KB Output is correct
24 Correct 284 ms 15056 KB Output is correct
25 Correct 268 ms 15004 KB Output is correct
26 Correct 263 ms 15004 KB Output is correct
27 Correct 260 ms 15092 KB Output is correct
28 Correct 132 ms 15028 KB Output is correct
29 Correct 128 ms 15004 KB Output is correct
30 Correct 0 ms 204 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 187 ms 23948 KB Output is correct
3 Correct 197 ms 24048 KB Output is correct
4 Correct 189 ms 24004 KB Output is correct
5 Correct 187 ms 24048 KB Output is correct
6 Correct 197 ms 23992 KB Output is correct
7 Correct 189 ms 24032 KB Output is correct
8 Correct 185 ms 24004 KB Output is correct
9 Correct 163 ms 14984 KB Output is correct
10 Correct 163 ms 14916 KB Output is correct
11 Correct 50 ms 12232 KB Output is correct
12 Correct 49 ms 12564 KB Output is correct
13 Correct 54 ms 12592 KB Output is correct
14 Correct 50 ms 12588 KB Output is correct
15 Correct 49 ms 12564 KB Output is correct
16 Correct 51 ms 12580 KB Output is correct
17 Correct 50 ms 12564 KB Output is correct
18 Correct 44 ms 12596 KB Output is correct
19 Correct 43 ms 12636 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 101 ms 13048 KB Output is correct
22 Correct 95 ms 12832 KB Output is correct
23 Correct 100 ms 12912 KB Output is correct
24 Correct 95 ms 12920 KB Output is correct
25 Correct 94 ms 12828 KB Output is correct
26 Correct 95 ms 12860 KB Output is correct
27 Correct 94 ms 12852 KB Output is correct
28 Correct 56 ms 12828 KB Output is correct
29 Correct 53 ms 12864 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 8 ms 1228 KB Output is correct
42 Correct 7 ms 1216 KB Output is correct
43 Correct 8 ms 1228 KB Output is correct
44 Correct 7 ms 1228 KB Output is correct
45 Correct 8 ms 1280 KB Output is correct
46 Correct 8 ms 1284 KB Output is correct
47 Correct 8 ms 1228 KB Output is correct
48 Correct 8 ms 840 KB Output is correct
49 Correct 4 ms 844 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 287 ms 14996 KB Output is correct
52 Correct 269 ms 15016 KB Output is correct
53 Correct 271 ms 15012 KB Output is correct
54 Correct 284 ms 15056 KB Output is correct
55 Correct 268 ms 15004 KB Output is correct
56 Correct 263 ms 15004 KB Output is correct
57 Correct 260 ms 15092 KB Output is correct
58 Correct 132 ms 15028 KB Output is correct
59 Correct 128 ms 15004 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 420 ms 29252 KB Output is correct
62 Correct 438 ms 29400 KB Output is correct
63 Correct 466 ms 29340 KB Output is correct
64 Correct 471 ms 29364 KB Output is correct
65 Correct 444 ms 29344 KB Output is correct
66 Correct 430 ms 29392 KB Output is correct
67 Correct 456 ms 29360 KB Output is correct
68 Correct 331 ms 20344 KB Output is correct
69 Correct 293 ms 17200 KB Output is correct
70 Correct 0 ms 204 KB Output is correct