oj.uz

Submission #369925

# Submission time Handle Problem Language Result Execution time Memory
369925 2021-02-22T18:33:03 Z FatihSolak Kvalitetni (COCI16_kvalitetni) C++17
120 / 120
 8 ms 2560 KB 
#include <bits/stdc++.h>
#define N 1000005
#define K 55
using namespace std;
int arr[K];
int c[N];
string s;
long double calc(int l,int r){
    if(l +2 == r){
        return arr[1];
    }
    bool carp = 0;
    l++;
    if(c[l] != r && s[c[l]+1] == '*')carp = 1;
    vector<long double> nums;
    while(l < r){
        nums.push_back(calc(l,c[l]));
        l = c[l]+2;
    }
    sort(nums.begin(),nums.end());
    if(carp){
        long double ret = 1;
        long double remain = arr[nums.size()];
        for(int i=0;i<nums.size();i++){
            long double now = min(nums[i],(remain)/(nums.size()-i));
            ret *= now;
            remain -= now;
        }
        return ret;
    }
    else{
        long double ret = 0;
        for(auto u:nums)ret+=u;
        return min(ret,(long double)arr[nums.size()]);
    }
}
void solve(){
    int k;
    cin >> k;
    for(int i=1;i<=k;i++){
        cin >> arr[i];
    }
    cin >> s;
    stack<int> st;
    for(int i=0;i<s.length();i++){
        if(s[i] == '('){
            st.push(i);
        }
        if(s[i] == ')'){
            c[st.top()] = i;
            st.pop();
        }
    }
    cout << fixed << setprecision(6) << calc(0,s.length()-1);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

kvalitetni.cpp: In function 'long double calc(int, int)':
kvalitetni.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int i=0;i<nums.size();i++){
      |                     ~^~~~~~~~~~~~
kvalitetni.cpp: In function 'void solve()':
kvalitetni.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i=0;i<s.length();i++){
      |                 ~^~~~~~~~~~~

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 492 KB Output is correct

Subtask #5
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 #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

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

Subtask #8
12.0 / 12.0

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

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1528 KB Output is correct
2 Correct 8 ms 2560 KB Output is correct

Subtask #10
12.0 / 12.0

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