oj.uz

Submission #167180

# Submission time Handle Problem Language Result Execution time Memory
167180 2019-12-06T08:35:17 Z egekabas Kvalitetni (COCI16_kvalitetni) C++14
120 / 120
 19 ms 1288 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll k;
ld z[100];
string s;
ld func(ll l, ll r){
    if(l == r)
        return z[1];
    ld depth = 0;
    vector<ld> v;
    char op;
    int l1;
    int cnt = 0;
    for(int i = l; i <= r; ++i){
        if(s[i] == '('){
            depth++;
            if(depth == 1)
                l1 = i;
        }
        else if(s[i] == ')'){
            --depth;
            if(depth == 0)
                v.pb(func(l1+1, i-1));
        }
        else if(depth == 0)
            op = s[i];
    }
    if(op == '+'){
        ld ret = 0;
        for(auto u : v)
            ret += u;
        return min(z[v.size()], ret);        
    }
    else{

        sort(v.begin(), v.end());
        ld ans = 1;
        ld maxisum = z[v.size()];
        for(ll i = 0; i < v.size(); ++i){
            //cout << v[i] << "\n";
            if(v[i] <= maxisum/((ld)v.size()-(ld)i)){
                ans *= v[i];
                maxisum -= v[i];
            }
            else{
                ans *= (maxisum/((ld)v.size()-(ld)i));
                maxisum -= maxisum/((ld)v.size()-(ld)i);
            }
        }
        return ans;
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> k;
    for(ll i = 1; i <= k; ++i)
        cin >> z[i];
    cin >> s;    
    cout << fixed << setprecision(10) << func(1, s.size()-2) << "\n";
}

Compilation message

kvalitetni.cpp: In function 'ld func(ll, ll)':
kvalitetni.cpp:50:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll i = 0; i < v.size(); ++i){
                       ~~^~~~~~~~~~
kvalitetni.cpp:24:9: warning: unused variable 'cnt' [-Wunused-variable]
     int cnt = 0;
         ^~~
kvalitetni.cpp:39:5: warning: 'op' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if(op == '+'){
     ^~
kvalitetni.cpp:34:29: warning: 'l1' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 v.pb(func(l1+1, i-1));
                           ~~^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 12 ms 900 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 13 ms 900 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 19 ms 1284 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 632 KB Output is correct
2 Correct 15 ms 1288 KB Output is correct