oj.uz

Submission #634998

# Submission time Handle Problem Language Result Execution time Memory
634998 2022-08-25T10:05:24 Z minhcool 즐거운 채소 기르기 (JOI14_growing) C++17
45 / 100
 85 ms 20484 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];

int BIT[N];

void upd(int id, int val){
    for(; id <= n; id += id & -id) BIT[id] += val;
}

int gett(int id){
    int ans = 0;
    for(; id; id -= id & -id) ans += BIT[id];
    return ans;
}

int get(int l, int r){
    return gett(r) - gett(l - 1);
}

map<int, vector<int>> mp;
 
void process(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        mp[a[i]].pb(i);
        //vc.pb({a[i], i});
    }
    //sort(vc.begin(), vc.end(), cmp);
    for(int i = 1; i <= n; i++) upd(i, 1);
    int answer = 0;
    for(auto it : mp){
        //cout << it.fi << "\n";
        deque<int> dq;
        vector<int> temp = it.se;
        sort(temp.begin(), temp.end());
        for(auto it : temp) dq.push_back(it);
        while(!dq.empty()){
            int pos1 = dq.front(), pos2 = dq.back();
            int temp1 = get(1, pos1 - 1), temp2 = get(pos2 + 1, n);
            //cout << temp1 << " " << temp2 << "\n";
            if(temp1 < temp2){
                upd(pos1, -1);
                dq.pop_front();
            }
            else{
                upd(pos2, -1);
                dq.pop_back();
            }
            answer += min(temp1, temp2);
        }
        //cout << answer << "\n";
    }
    /*
    for(auto it : vc){
        while(vc[itr].fi > it.fi){
            upd(vc[itr].se, 1);
            itr++;
        }
        //cout << it.fi << " " << it.se << " " << itr << " " << get(it.se - 1) << " ""\n";
        answer += min(get(it.se - 1), get(n) - get(it.se));
    }*/
    
    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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 884 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 4 ms 852 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1236 KB Output is correct
2 Correct 85 ms 11936 KB Output is correct
3 Runtime error 50 ms 20484 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -