oj.uz

Submission #903306

# Submission time Handle Problem Language Result Execution time Memory
903306 2024-01-11T06:57:52 Z Muhammad_Aneeq Holiday (IOI14_holiday) C++17
23 / 100
 30 ms 5496 KB 
#include <queue>
#include <vector>
#include <set>
#include <iostream>
#include "holiday.h"
using namespace std;
long long findMaxAttraction(int n, int start, int d, int attraction[])
{
	long long ans=0;
	if (start==0)
	{
		multiset<int>s;
		long long z=0;
		for (int j=0;j<min(n,d-1);j++)
		{
			s.insert(attraction[j]);
			z+=attraction[j];
			while (j+s.size()>d)
			{
				z-=*begin(s);
				s.erase(begin(s));
			}
			ans=max(ans,z);
		}
		return ans;
	}
	for (int i=0;i<n;i++)
	{

	}
	return 0;
}

Compilation message

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:18:21: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |    while (j+s.size()>d)
      |           ~~~~~~~~~~^~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5460 KB Output is correct
2 Correct 21 ms 5464 KB Output is correct
3 Correct 30 ms 5496 KB Output is correct
4 Correct 27 ms 5464 KB Output is correct
5 Correct 23 ms 3672 KB Output is correct
6 Correct 7 ms 2140 KB Output is correct
7 Correct 12 ms 2720 KB Output is correct
8 Correct 14 ms 2652 KB Output is correct
9 Correct 6 ms 1628 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 856 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -