oj.uz

답안 #758244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758244 2023-06-14T10:13:02 Z vjudge1 Money (IZhO17_money) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    ordered_set st;
    int n;
    cin>>n;
    pair<int,int>pr[n];
    for(int i=0;i<n;i++){cin>>pr[i].first;pr[i].second=i;}
    sort(pr,pr+n);
    vector<int>v;
    for(auto &i:pr)v.push_back(i.second);
    int ans=0;
    for(int i=1;i<n;i++){
        if(v[i]!=v[i-1])ans++;
    }
    cout<<ans/2+1;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -