oj.uz

Submission #432791

# Submission time Handle Problem Language Result Execution time Memory
432791 2021-06-18T13:23:10 Z REALITYNB Holiday (IOI14_holiday) C++17
24 / 100
 5000 ms 5256 KB 
#include <bits/stdc++.h>
#include "holiday.h"
using namespace std;
long long findMaxAttraction(int n , int start , int d , int* a){
    #define int long long
    int ans = 0 ;
    for(int i=start;i<n;i++){
        multiset<int> el ;
        for(int j=start;j<=i;j++) el.insert(a[j])  ;
        int sum = 0;
        int rest = d-(i-start) ;
        if(rest<0) break ;
        while(el.size()>rest)
            el.erase(el.begin());
        for(int x: el) sum+=x ;
        ans=max(ans,sum) ;
       // cout << i << " "<< sum << endl ;
        for(int j=start-1;j>-1;--j){
            rest = d-(min(start-j,i-start)*2+max(start-j,i-start));
            //cout << i << " "<< j << " "<< rest << endl ;
            if(rest<0) break ;
            el.insert(a[j]) ;
            sum+=a[j] ;
            while(el.size()>rest){
                sum-=*el.begin();
                el.erase(el.begin()) ;
            }
            //cout << i << " "<< j << " "<< rest << " " << sum  << endl ;
            ans=max(ans,sum) ;
        }
    }
    return ans ;
    #undef int
}
/*int main(){
    int a[5]= {10,2,20,30,1} ;
    cout << findMaxAttraction(5,2,7,a) ;
    return 0 ;
}
*/

Compilation message

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:13:24: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   13 |         while(el.size()>rest)
      |               ~~~~~~~~~^~~~~
holiday.cpp:24:28: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   24 |             while(el.size()>rest){
      |                   ~~~~~~~~~^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5086 ms 1032 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 498 ms 852 KB Output is correct
5 Correct 157 ms 772 KB Output is correct
6 Correct 49 ms 832 KB Output is correct
7 Correct 21 ms 700 KB Output is correct
8 Correct 21 ms 588 KB Output is correct
9 Correct 17 ms 588 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5256 KB Output is correct
2 Execution timed out 5054 ms 1184 KB Time limit exceeded
3 Halted 0 ms 0 KB -