oj.uz

Submission #526314

# Submission time Handle Problem Language Result Execution time Memory
526314 2022-02-14T09:28:17 Z Carmel_Ab1 Mountains (NOI20_mountains) C++17
66 / 100
 204 ms 29412 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;
    int sz=1;
    seg(int n){
        sz=2*n;
        t.resize(sz);
    }
    void upd(int i,int v){
        t[i+=sz/2]+=v;
        while(i>1){
            t[i/2]=t[i]+t[i^1];
            i/=2;
        }
    }
    int qur(int l,int r){
        int 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() {
    int 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 0 ms 308 KB Output is correct
2 Correct 192 ms 29292 KB Output is correct
3 Correct 202 ms 29264 KB Output is correct
4 Correct 195 ms 29412 KB Output is correct
5 Correct 195 ms 29280 KB Output is correct
6 Correct 199 ms 29340 KB Output is correct
7 Correct 197 ms 29264 KB Output is correct
8 Correct 204 ms 29392 KB Output is correct
9 Correct 177 ms 20304 KB Output is correct
10 Correct 167 ms 20432 KB Output is correct

Subtask #2
0 / 4.0

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

Subtask #3
0 / 9.0

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

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 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 316 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 316 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 300 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 316 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 316 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 1216 KB Output is correct
12 Correct 7 ms 1248 KB Output is correct
13 Correct 8 ms 1200 KB Output is correct
14 Correct 7 ms 1228 KB Output is correct
15 Correct 8 ms 1208 KB Output is correct
16 Correct 8 ms 1196 KB Output is correct
17 Correct 7 ms 1220 KB Output is correct
18 Correct 6 ms 844 KB Output is correct
19 Correct 5 ms 844 KB Output is correct
20 Correct 0 ms 204 KB Output is correct

Subtask #6
0 / 9.0

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

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 192 ms 29292 KB Output is correct
3 Correct 202 ms 29264 KB Output is correct
4 Correct 195 ms 29412 KB Output is correct
5 Correct 195 ms 29280 KB Output is correct
6 Correct 199 ms 29340 KB Output is correct
7 Correct 197 ms 29264 KB Output is correct
8 Correct 204 ms 29392 KB Output is correct
9 Correct 177 ms 20304 KB Output is correct
10 Correct 167 ms 20432 KB Output is correct
11 Incorrect 57 ms 12596 KB Output isn't correct
12 Halted 0 ms 0 KB -