oj.uz

답안 #151063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151063 2019-09-01T16:22:04 Z Benq HicCup (FXCUP4_hiccup) C++17
100 / 100
 67 ms 29040 KB 
#include "hiccup.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    // friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend void pr(const modular& a) { pr(a.val); }
    friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
    friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vi v[1000005];
int ans = MOD;

void process(vi v) {
	reverse(all(v));
	int sum = 0;
	F0R(i,sz(v)) {
		sum += v[i];
		ckmin(ans,sum/(i+1));
	}
}

int HicCup(std::string S) {
	int N = S.size();
	string cool;
	int bal = 0, lev = 0;
	F0R(i,N) {
		if (S[i] == '!') {
			if (i == 0 || S[i-1] == 'H') return -1;
			v[lev].back() ++;
		} else {
			if (S[i] == 'H') bal ++;
			else bal --;
			if (bal < 0) return -1;
			cool += S[i];
			if (sz(cool) > 1) {
				if (cool.back() == 'H' && cool[sz(cool)-2] == 'H') lev ++;
				if (cool.back() == 'C' && cool[sz(cool)-2] == 'C') {
					process(v[lev]);
					v[lev].clear();
					lev --;
				}
			}
			if (cool.back() == 'C') v[lev].pb(0);
		}
	}
	if (bal != 0) return -1;
	process(v[0]);
	return ans;
}

Compilation message

hiccup.cpp: In function 'void io::setIn(std::__cxx11::string)':
hiccup.cpp:112:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
hiccup.cpp: In function 'void io::setOut(std::__cxx11::string)':
hiccup.cpp:113:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23772 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 67 ms 29040 KB Output is correct
6 Correct 30 ms 26744 KB Output is correct
7 Correct 31 ms 26744 KB Output is correct
8 Correct 67 ms 28888 KB Output is correct
9 Correct 66 ms 28868 KB Output is correct
10 Correct 31 ms 26744 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct

Subtask #2
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23772 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 67 ms 29040 KB Output is correct
6 Correct 30 ms 26744 KB Output is correct
7 Correct 31 ms 26744 KB Output is correct
8 Correct 67 ms 28888 KB Output is correct
9 Correct 66 ms 28868 KB Output is correct
10 Correct 31 ms 26744 KB Output is correct
11 Correct 36 ms 27256 KB Output is correct
12 Correct 35 ms 27000 KB Output is correct
13 Correct 31 ms 26744 KB Output is correct
14 Correct 23 ms 23800 KB Output is correct
15 Correct 30 ms 26744 KB Output is correct
16 Correct 23 ms 23800 KB Output is correct
17 Correct 24 ms 23800 KB Output is correct
18 Correct 24 ms 24056 KB Output is correct
19 Correct 38 ms 26844 KB Output is correct
20 Correct 38 ms 27000 KB Output is correct
21 Correct 38 ms 27000 KB Output is correct
22 Correct 37 ms 26924 KB Output is correct
23 Correct 39 ms 27048 KB Output is correct
24 Correct 39 ms 27256 KB Output is correct
25 Correct 56 ms 28092 KB Output is correct
26 Correct 45 ms 27640 KB Output is correct
27 Correct 38 ms 27000 KB Output is correct
28 Correct 37 ms 26872 KB Output is correct
29 Correct 38 ms 27000 KB Output is correct
30 Correct 25 ms 23800 KB Output is correct
31 Correct 24 ms 23800 KB Output is correct
32 Correct 25 ms 24184 KB Output is correct
33 Correct 24 ms 23800 KB Output is correct