oj.uz

Submission #329140

# Submission time Handle Problem Language Result Execution time Memory
329140 2020-11-19T12:54:29 Z oak Mountains (NOI20_mountains) C++14
64 / 100
 2000 ms 3244 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,j,i;
	scanf("%d",&n);
	long long arr[n],sum[n];
	multiset<long long> ms;
	for(i=0;i<n;i++){
		scanf("%lld",&arr[i]);
		ms.insert(arr[i]);
		sum[i] = distance(ms.begin(),ms.lower_bound(arr[i]));
		//printf("%d ",sum[i]);
	}
	//printf("\n");
	long long ans = 0;
	ms.clear();
	for(i=n-1;i>=0;i--){
		ms.insert(arr[i]);
		sum[i] *= distance(ms.begin(),ms.lower_bound(arr[i]));
		ans += sum[i]*1ll;
		//printf("%d ",sum[i]);
	}
	//printf("\n");
	printf("%lld",ans);
}

Compilation message

Mountains.cpp: In function 'int main()':
Mountains.cpp:4:8: warning: unused variable 'j' [-Wunused-variable]
    4 |  int n,j,i;
      |        ^
Mountains.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    5 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
Mountains.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |   scanf("%lld",&arr[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Execution timed out 2084 ms 1900 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 3244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 3244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
36.0 / 36.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 696 ms 1132 KB Output is correct
12 Correct 678 ms 1260 KB Output is correct
13 Correct 678 ms 1260 KB Output is correct
14 Correct 670 ms 1324 KB Output is correct
15 Correct 676 ms 1132 KB Output is correct
16 Correct 680 ms 1132 KB Output is correct
17 Correct 677 ms 1260 KB Output is correct
18 Correct 685 ms 1260 KB Output is correct
19 Correct 604 ms 1132 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 3244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Execution timed out 2084 ms 1900 KB Time limit exceeded
3 Halted 0 ms 0 KB -