oj.uz

Submission #634975

# Submission time Handle Problem Language Result Execution time Memory
634975 2022-08-25T09:44:49 Z minhcool 즐거운 채소 기르기 (JOI14_growing) C++17
45 / 100
 1000 ms 704 KB 
//#include "ramen.h"
#include<bits/stdc++.h>
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n, a[N];
 
void process(){
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    int answer = 0;
    for(int i = 1; i <= n; i++){
        int tol1 = 0, tol2 = 0;
        for(int j = 1; j < i; j++) tol1 += (a[j] > a[i]);
        for(int j = i + 1; j <= n; j++) tol2 += (a[j] > a[i]);
        answer += min(tol1, tol2);
    }
    cout << answer;
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}

Compilation message

growing.cpp:19:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 13 ms 372 KB Output is correct
5 Correct 22 ms 384 KB Output is correct
6 Correct 20 ms 340 KB Output is correct
7 Correct 17 ms 384 KB Output is correct
8 Correct 20 ms 340 KB Output is correct
9 Correct 21 ms 340 KB Output is correct
10 Correct 22 ms 400 KB Output is correct

Subtask #4
0 / 55.0

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