oj.uz

답안 #150264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150264 2019-09-01T08:00:52 Z Avengers(#3759, Blagojce) HicCup (FXCUP4_hiccup) C++17
24 / 100
 85 ms 38776 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;

#include "hiccup.h"
vector<int> nums[1000006];
vector<int> v;
bool ok(int x, int id){
        v = nums[id];
        int p2 = v.size() - 1;
        int p1 = 0;
        int N = v.size();
        int r = N - 1;
        fr(i, 0, N){
                if(v[i] < x){
                        for(int j = r; j > i; j --){
                                if(v[j] - x >= x - v[i]){
                                        v[i] = x;
                                        v[j] -= x;
                                        r = j;
                                        break;
                                }
                        }
                        if(v[i] < x) return false;
                }
        }

        return true;
}
int HicCup(std::string s) {
	int n = s.size();
	int cnt[n];
	int c =  0;
	for(int i = n - 1; i >= 0; i --){
                if(s[i] == '!') c ++;
                cnt[i] = c;
                if(s[i] == 'C') c = 0;
                else if(s[i] == 'H' && c > 0) return -1;
	}

	if(c > 0) return -1;
	stack <int> S;
	S.push(0);
	int ANS = n;
	fr(i, 0, n){
                if(s[i] == 'H') S.push(i + 1);
                else if(s[i] == 'C'){
                        if((int)(S.size()) == 1) return -1;
                        int id = S.top();
                        S.pop();
                        nums[(int)S.top()].pb(cnt[i]);
                        if(nums[id].empty()) continue;
                        int k = 0;
                        for(int b = ANS / 2; b >= 1; b /= 2){
                                while(k + b <= ANS && ok(k + b, id)) k += b;
                        }
                        ANS = min(ANS, k);


                 }
	}
        if((int)S.size() > 1)return -1;
        if(!nums[0].empty()){
                int k = 0;
                for(int b = ANS / 2; b >= 1; b /= 2){
                        while(k + b <= ANS && ok(k + b, 0)) k += b;
                }
                ANS = min(ANS, k);
        }
        return ANS;
}/*
int main(){
        cout << HicCup("HC!!HC!!!!!HC!!");
}*/

Compilation message

hiccup.cpp: In function 'bool ok(int, int)':
hiccup.cpp:17:13: warning: unused variable 'p2' [-Wunused-variable]
         int p2 = v.size() - 1;
             ^~
hiccup.cpp:18:13: warning: unused variable 'p1' [-Wunused-variable]
         int p1 = 0;
             ^~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 24 ms 24448 KB Output is correct
5 Correct 82 ms 38776 KB Output is correct
6 Correct 36 ms 30712 KB Output is correct
7 Correct 38 ms 30584 KB Output is correct
8 Correct 80 ms 38776 KB Output is correct
9 Correct 85 ms 38776 KB Output is correct
10 Correct 37 ms 30712 KB Output is correct
11 Correct 20 ms 23808 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 24 ms 24448 KB Output is correct
5 Correct 82 ms 38776 KB Output is correct
6 Correct 36 ms 30712 KB Output is correct
7 Correct 38 ms 30584 KB Output is correct
8 Correct 80 ms 38776 KB Output is correct
9 Correct 85 ms 38776 KB Output is correct
10 Correct 37 ms 30712 KB Output is correct
11 Correct 28 ms 26744 KB Output is correct
12 Correct 28 ms 27520 KB Output is correct
13 Correct 32 ms 29304 KB Output is correct
14 Correct 21 ms 23808 KB Output is correct
15 Correct 32 ms 30712 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 19 ms 23808 KB Output is correct
18 Correct 20 ms 24064 KB Output is correct
19 Incorrect 38 ms 30720 KB Output isn't correct
20 Halted 0 ms 0 KB -