oj.uz

Submission #288289

# Submission time Handle Problem Language Result Execution time Memory
288289 2020-09-01T11:39:18 Z AKaan37 Holiday (IOI14_holiday) C++17
23 / 100
 38 ms 6264 KB 
#include"holiday.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],k,flag,t;
lo cev;
multiset<lo> st;
string s;
vector<int> v;

long long int findMaxAttraction(int n, int start, int d, int a[]) {
	lo say=0;
	lo mx=0;
	for(int i=0;i<n;i++){
		int git=d-i;
		if(git<0)continue;
		cev+=a[i];
		st.insert(a[i]);
		say++;
		//~ cout<<say+1<<endl;
		while(say>git){
			auto it=st.begin();
			cev-=*it;
			st.erase(it);
			say--;
		}
		mx=max(mx,cev);
	}
    return mx;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5624 KB Output is correct
2 Correct 36 ms 5624 KB Output is correct
3 Correct 33 ms 5760 KB Output is correct
4 Correct 30 ms 5624 KB Output is correct
5 Correct 37 ms 3968 KB Output is correct
6 Correct 16 ms 1792 KB Output is correct
7 Correct 21 ms 2788 KB Output is correct
8 Correct 25 ms 2688 KB Output is correct
9 Correct 8 ms 1408 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6264 KB Output is correct
2 Correct 38 ms 6264 KB Output is correct
3 Incorrect 13 ms 1280 KB Output isn't correct
4 Halted 0 ms 0 KB -