oj.uz

Submission #903191

# Submission time Handle Problem Language Result Execution time Memory
903191 2024-01-11T06:09:47 Z Sir_Ahmed_Imran Holiday (IOI14_holiday) C++17
47 / 100
 5000 ms 6236 KB 
                              ///~~~LOTA~~~///
#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define MAXN 100001
ll findMaxAttraction(int n,int s,int d,int a[]){
    ll m,o,p,q;
    multiset<ll> S;
    for(int i=m=0;i<n;i++){
        o=0;
        for(int j=i;j<n;j++){
            if(j<=s)
                p=q=s-i;
            else if(i>=s)
                p=q=j-s;
            else{
                p=s-2*i+j;
                q=2*j-s-i;
            }
            p=min(p,q);
            p=d-p;
            if(p<=0) break; 
            while(S.size()>p){
                o-=*S.begin();
                S.erase(S.begin());
            }
            if(S.size()<p){
                o+=a[j];
                S.insert(a[j]);
            }
            else if(*S.begin()<a[j]){
                o+=a[j]-*S.begin();
                S.insert(a[j]);
                S.erase(S.begin());
            }
            m=max(o,m);
        }
        S.clear();
        if(!s) break;
    }
    return m;
}

Compilation message

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:30:27: 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]
   30 |             while(S.size()>p){
      |                   ~~~~~~~~^~
holiday.cpp:34: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]
   34 |             if(S.size()<p){
      |                ~~~~~~~~^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 608 KB Output is correct
6 Correct 1 ms 616 KB Output is correct
7 Correct 1 ms 616 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 5480 KB Output is correct
2 Correct 24 ms 5628 KB Output is correct
3 Correct 30 ms 5480 KB Output is correct
4 Correct 22 ms 5480 KB Output is correct
5 Correct 22 ms 3944 KB Output is correct
6 Correct 8 ms 2152 KB Output is correct
7 Correct 13 ms 3056 KB Output is correct
8 Correct 16 ms 2804 KB Output is correct
9 Correct 6 ms 1604 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 980 KB Output is correct
2 Correct 281 ms 972 KB Output is correct
3 Correct 266 ms 864 KB Output is correct
4 Correct 320 ms 920 KB Output is correct
5 Correct 269 ms 912 KB Output is correct
6 Correct 39 ms 600 KB Output is correct
7 Correct 14 ms 600 KB Output is correct
8 Correct 19 ms 604 KB Output is correct
9 Correct 19 ms 604 KB Output is correct

Subtask #4
0 / 53.0

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