oj.uz

Submission #240977

# Submission time Handle Problem Language Result Execution time Memory
240977 2020-06-22T00:06:11 Z AmineWeslati Mountains (NOI20_mountains) C++14
77 / 100
 119 ms 14556 KB 
//Never stop trying
#pragma GCC optimize("O3")
#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;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

const int MX=3e5+70;
int N;
int t[MX];
int bit[MX];
int r[MX],l[MX];


int lsb(int i){return i&-i;}
void update(int idx){
   while(idx<MX){
      bit[idx]++;
      idx+=lsb(idx);
   }
}

int getSum(int idx){
   int ans=0;
   while(idx>0){
      ans+=bit[idx];
      idx-=lsb(idx);
   }
   return ans;
}

int32_t main(){
   boost;
	memset(bit,0,MX);
	cin>>N;
	
	vpi vec;
	for(int i=0; i<N; i++){
      cin>>t[i];
      vec.pb({t[i],i});
	}sort(all(vec));

	int nb=0;
	for(int i=0; i<N; i++){
      if(i==0||vec[i-1].fi<vec[i].fi) nb++;
      t[vec[i].se]=nb;
	}


	for(int i=0; i<N; i++){
      l[i]=getSum(t[i]-1);
      update(t[i]);
	}

	memset(bit,0,MX);
	for(int i=N-1; i>=0; i--){
      r[i]=getSum(t[i]-1);
      update(t[i]);
	}

	int res=0;
	for(int i=0; i<N; i++) res+=r[i]*l[i];
	cout << res << endl;

   return 0;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 103 ms 14556 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 12500 KB Output is correct
2 Correct 105 ms 12500 KB Output is correct
3 Correct 96 ms 12648 KB Output is correct
4 Correct 98 ms 12496 KB Output is correct
5 Correct 98 ms 12500 KB Output is correct
6 Correct 94 ms 12500 KB Output is correct
7 Correct 96 ms 12500 KB Output is correct
8 Correct 75 ms 12500 KB Output is correct
9 Correct 74 ms 12468 KB Output is correct
10 Correct 6 ms 640 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 12500 KB Output is correct
2 Correct 105 ms 12500 KB Output is correct
3 Correct 96 ms 12648 KB Output is correct
4 Correct 98 ms 12496 KB Output is correct
5 Correct 98 ms 12500 KB Output is correct
6 Correct 94 ms 12500 KB Output is correct
7 Correct 96 ms 12500 KB Output is correct
8 Correct 75 ms 12500 KB Output is correct
9 Correct 74 ms 12468 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 97 ms 12500 KB Output is correct
12 Correct 101 ms 12500 KB Output is correct
13 Correct 97 ms 12500 KB Output is correct
14 Correct 94 ms 12504 KB Output is correct
15 Correct 98 ms 12504 KB Output is correct
16 Correct 96 ms 12488 KB Output is correct
17 Correct 96 ms 12500 KB Output is correct
18 Correct 75 ms 12500 KB Output is correct
19 Correct 72 ms 12624 KB Output is correct
20 Correct 5 ms 640 KB Output is correct

Subtask #4
36.0 / 36.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 9 ms 1152 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 9 ms 1152 KB Output is correct
14 Correct 9 ms 1152 KB Output is correct
15 Correct 9 ms 1152 KB Output is correct
16 Correct 9 ms 1152 KB Output is correct
17 Correct 9 ms 1152 KB Output is correct
18 Correct 9 ms 1152 KB Output is correct
19 Correct 8 ms 1152 KB Output is correct
20 Correct 5 ms 640 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 12500 KB Output is correct
2 Correct 105 ms 12500 KB Output is correct
3 Correct 96 ms 12648 KB Output is correct
4 Correct 98 ms 12496 KB Output is correct
5 Correct 98 ms 12500 KB Output is correct
6 Correct 94 ms 12500 KB Output is correct
7 Correct 96 ms 12500 KB Output is correct
8 Correct 75 ms 12500 KB Output is correct
9 Correct 74 ms 12468 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 97 ms 12500 KB Output is correct
12 Correct 101 ms 12500 KB Output is correct
13 Correct 97 ms 12500 KB Output is correct
14 Correct 94 ms 12504 KB Output is correct
15 Correct 98 ms 12504 KB Output is correct
16 Correct 96 ms 12488 KB Output is correct
17 Correct 96 ms 12500 KB Output is correct
18 Correct 75 ms 12500 KB Output is correct
19 Correct 72 ms 12624 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Incorrect 119 ms 13020 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 103 ms 14556 KB Output isn't correct
3 Halted 0 ms 0 KB -