oj.uz

Submission #368040

# Submission time Handle Problem Language Result Execution time Memory
368040 2021-02-19T10:54:36 Z Atill83 Kvalitetni (COCI16_kvalitetni) C++14
120 / 120
 6 ms 1368 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll n;
typedef long double ld;

int a[MAXN];
string s;
int Gnext = -1;
ld solve(int idx){
    if(s[idx] == '(' && s[idx + 1] == '?' && s[idx + 2] == ')'){
        Gnext = idx + 3;
        return a[1];
    }
    
    Gnext = idx + 1;
    vector<ld> dgs;
    char op = '_';
    while(1){
        dgs.push_back(solve(Gnext));
        if(s[Gnext] == ')')
            break;
        op = s[Gnext++];
    }
    Gnext++;

    sort(dgs.begin(), dgs.end());

    int k = dgs.size();

    ld z = a[k];

    ld mx;

    if(op == '+')
        mx = 0;
    else
        mx = 1;

    for(ld i: dgs){
        //cerr<<i<<endl;
        ld kc = min((ld) z / k, i);
        z -= kc;
        k--;
        if(op == '*')
            mx = mx * kc;
        else
            mx = mx + kc;
    }
    return mx;
}









int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 1; i <= n; i++)
        cin>>a[i];
    
    cin>>s;

    cout<<fixed<<setprecision(5)<<solve(0)<<endl;




    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 4 ms 888 KB Output is correct

Subtask #8
12.0 / 12.0

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

Subtask #9
12.0 / 12.0

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

Subtask #10
12.0 / 12.0

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