oj.uz

Submission #106716

# Submission time Handle Problem Language Result Execution time Memory
106716 2019-04-19T19:19:58 Z tincamatei Holiday (IOI14_holiday) C++14
30 / 100
 83 ms 1280 KB 
#include"holiday.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;
const long long INF = 1LL << 60;

int str[101];

long long getFirstK(int k) {
	long long sum = 0LL;
	for(int i = 100; i >= 0; --i) {
		if(str[i] <= k) {
			k -= str[i];
			sum += str[i] * i;
		} else {
			sum += i * k;
			k = 0;
		}
	}

	return sum;
}

long long int findMaxAttraction(int n, int start, int d, int _attraction[]) {
	long long rez = 0LL;
	if(n <= 20) {
		for(int mask = 0; mask < (1 << n); ++mask) {
			long long sum = 0LL;
			int first = start, last = start;
			int used = 0;

			for(int j = 0; j < n; ++j)
				if((1 << j) & mask) {
					first = min(first, j);
					last = max(last, j);
					used++;
					sum += _attraction[j];
				}

			if(used + last - first + min(start - first, last - start) <= d) {
				rez = max(rez, sum);
			}
		}
	} else {
		rez = 0LL;
		for(int i = 0; i < n; ++i) {
			int k = d - i;
			str[_attraction[i]]++;
			rez = max(rez, getFirstK(k));
		}
	}

	return rez;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:7:12: warning: variable 'n_s' set but not used [-Wunused-but-set-variable]
     int i, n_s;
            ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 384 KB Output is correct
2 Correct 75 ms 256 KB Output is correct
3 Correct 83 ms 512 KB Output is correct
4 Correct 72 ms 376 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 744 KB Output is correct
2 Correct 26 ms 768 KB Output is correct
3 Correct 23 ms 768 KB Output is correct
4 Correct 24 ms 768 KB Output is correct
5 Correct 24 ms 768 KB Output is correct
6 Correct 11 ms 384 KB Output is correct
7 Correct 12 ms 512 KB Output is correct
8 Correct 15 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 1280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -