Submission #248969

#	Time	Username	Problem	Language	Result	Execution time	Memory
248969		leaked	Kvalitetni (COCI16_kvalitetni)	C++14	120 / 120	18 ms	3088 KiB

kvalitetni

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=1e2+1;
const int M=1e6+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
    cout<<-1;
    exit(0);
}
int n,t;
int k[N];
vector<int>lol;
vector<int>pos_v;
char vir[M];
int nd[M];
    string s;
ld rec(int l,int r){
    if(l==r){
        return (ld)k[0];
    }
    vector<ld>ps;
   // debug()<<imie(l)<<imie(r);
    char op='+';
    for(int i=l+1;i<r;i++){
        ps.p_b(rec(i,nd[i]));
        if(s[nd[i]+1]=='+' || s[nd[i]+1]=='*')op=s[nd[i]+1];
        i=nd[i]+1;
    }
    sort(all(ps));
    //debug()<<imie(l)<<imie(r);
   //debug()<<imie(ps);
    if(op=='+'){
        ld sum=0;
        for(auto &z : ps) sum+=z;
        return min(sum,(ld)k[sz(ps)-1]);
    }
    else{
        ld res=1;
        ld ost=k[sz(ps)-1];
        for(int i=0;i<sz(ps);i++){
            ld mn=min(ps[i],ost/(sz(ps)-i));
            res*=mn;
            ost-=mn;
        }
        return res;
    }
}
signed main()
{
    fast_io;
    cin>>t;
    for(int i=0;i<t;i++) cin>>k[i];
    cin>>s;
    char lst='z';
    for(int i=0;i<sz(s);i++){
        nd[i]=i;
        if(s[i]=='('){
            lol.p_b(i);
            pos_v.p_b(i);
        }
        else if(s[i]==')'){
            nd[lol.back()]=i;
            lol.pop_back();
        }
        else{
            lst=s[i];
        }
      //  debug()<<imie(lol);
    }
    cout<<fixed<<setprecision(10)<<rec(0,sz(s)-1);
    return 0;
}
/*

*/

Compilation message (stderr)

kvalitetni.cpp: In function 'int main()':
kvalitetni.cpp:130:10: warning: variable 'lst' set but not used [-Wunused-but-set-variable]
     char lst='z';
          ^~~

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12