oj.uz

답안 #237337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237337 2020-06-06T03:02:09 Z aloo123 Baloni (COCI15_baloni) C++14
40 / 100
 22 ms 1792 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
#define pr(x) cout<<x<<endl;
#define pr2(x,y) cout<<x<<" "<<y<<endl;
#define pr3(x,y,z) cout<<x<<" "<<y<<endl;
#define prv(v) for(auto x:v) cout<<x<<" ";
#define ffs fflush(stdout);
#define int ll
#define sz(x) (ll)x.size()
using namespace std;
 
 
const ll MOD = 1e9+7;
const ll INF = LLONG_MAX;
const ll LOG = 29;
#define PI 3.141592653589793238 
 
 
 


const ll N =(1e5+5);

ll fact[N];

long long binpow(long long a, long long b) {
     a%=MOD;    
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = (res * a)%MOD;
        a = (a * a)%MOD;
 
        
        b >>= 1;
    }
     res%=MOD;
    return res;
}
void ini(){
    fact[0] = 1;
    for(int i = 1;i < N;i++){
        fact[i] = (fact[i-1] * i)%MOD;
    }
}
ll ncr(ll n,ll r){
    ll ret = fact[n];
    ret = (ret * binpow(fact[r],MOD-2))%MOD;
    ret = (ret * binpow(fact[n-r],MOD-2))%MOD;
    return ret;
}
ll n;
ll a[N];
bool vis[N];
void solve(){
    cin >> n;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
    }
    ll ans =0;
    for(int i = 1;i <= n;i++){
        if(vis[i]) continue;
        ans++;
        ll h = a[i];
       // cout << "HERE " << i << " -> ";
        for(int j=i;j<=n;j++){
            if(vis[j])continue;
            if(a[j] == h){
                
         //   cout << j << endl;
                h--;
                vis[j]=true;
            }
        }

    }
    cout << ans << endl;
}       

 
signed main(){
    ios_base::sync_with_stdio(0);
    // cin.tie(NULL);
    
       
 
     ll tt=1;   
    // cin >> tt;
    while(tt--){
        solve();
    }    
}

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 16 ms 384 KB Output is correct
4 Correct 22 ms 384 KB Output is correct
5 Incorrect 17 ms 1792 KB Output isn't correct
6 Incorrect 14 ms 1792 KB Output isn't correct
7 Incorrect 14 ms 1792 KB Output isn't correct
8 Incorrect 13 ms 1792 KB Output isn't correct
9 Incorrect 15 ms 1780 KB Output isn't correct
10 Incorrect 13 ms 1792 KB Output isn't correct