oj.uz

답안 #240972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240972 2020-06-21T23:56:09 Z AmineWeslati Mountains (NOI20_mountains) C++14
13 / 100
 74 ms 11384 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+10;
int N;
int t[MX];
int bit[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;
	int r[N],l[N];
	for(int i=0; i<N; i++) cin>>t[i];

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

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

	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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Runtime error 72 ms 11384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 8440 KB Output is correct
2 Correct 58 ms 8312 KB Output is correct
3 Correct 60 ms 8312 KB Output is correct
4 Correct 60 ms 8312 KB Output is correct
5 Correct 61 ms 8312 KB Output is correct
6 Correct 60 ms 8312 KB Output is correct
7 Correct 61 ms 8312 KB Output is correct
8 Correct 57 ms 8312 KB Output is correct
9 Correct 57 ms 8312 KB Output is correct
10 Correct 5 ms 640 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 8440 KB Output is correct
2 Correct 58 ms 8312 KB Output is correct
3 Correct 60 ms 8312 KB Output is correct
4 Correct 60 ms 8312 KB Output is correct
5 Correct 61 ms 8312 KB Output is correct
6 Correct 60 ms 8312 KB Output is correct
7 Correct 61 ms 8312 KB Output is correct
8 Correct 57 ms 8312 KB Output is correct
9 Correct 57 ms 8312 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 53 ms 8568 KB Output is correct
12 Correct 57 ms 8568 KB Output is correct
13 Correct 54 ms 8568 KB Output is correct
14 Correct 58 ms 8568 KB Output is correct
15 Correct 54 ms 8568 KB Output is correct
16 Correct 57 ms 8568 KB Output is correct
17 Correct 55 ms 8568 KB Output is correct
18 Correct 56 ms 8568 KB Output is correct
19 Correct 56 ms 8528 KB Output is correct
20 Correct 5 ms 640 KB Output is correct

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 8440 KB Output is correct
2 Correct 58 ms 8312 KB Output is correct
3 Correct 60 ms 8312 KB Output is correct
4 Correct 60 ms 8312 KB Output is correct
5 Correct 61 ms 8312 KB Output is correct
6 Correct 60 ms 8312 KB Output is correct
7 Correct 61 ms 8312 KB Output is correct
8 Correct 57 ms 8312 KB Output is correct
9 Correct 57 ms 8312 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 53 ms 8568 KB Output is correct
12 Correct 57 ms 8568 KB Output is correct
13 Correct 54 ms 8568 KB Output is correct
14 Correct 58 ms 8568 KB Output is correct
15 Correct 54 ms 8568 KB Output is correct
16 Correct 57 ms 8568 KB Output is correct
17 Correct 55 ms 8568 KB Output is correct
18 Correct 56 ms 8568 KB Output is correct
19 Correct 56 ms 8528 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Incorrect 74 ms 9848 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Runtime error 72 ms 11384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -