Submission #2123056


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)
#define allof(a) (a).begin(),(a).end()
template< typename T > using Vec = vector< T >;
typedef long long lint;
 
int N;
lint a[102];
bool deleted[102];

int minElem(int s) {
	for_(i,s,N+1) if (!deleted[i]) return i;
	return -1;
}

lint rec(int x) {
	int nxt_x = minElem(x+1);
	lint res = (nxt_x == -1 ? a[x-1] : rec(nxt_x) + a[x-1]);
	
	Vec< int > del;
	for (int a=2; a * x <= N; ++a) if (!deleted[a * x]) del.push_back(a * x);
	for (int i : del) deleted[i] = true;
	
	nxt_x = minElem(x+1);
	res = (nxt_x == -1 ? max(res, 0LL) : max(res, rec(nxt_x)));
	
	for (int i : del) deleted[i] = false;
		
	return res;
}
 
int main() {
	cin >> N;
	for_(i,0,N) cin >> a[i];
	memset(deleted, false, sizeof(deleted));
	cout << rec(1) << endl;
}

Submission Info

Submission Time
Task E - MUL
User tsukasa_diary
Language C++14 (GCC 5.4.1)
Score 0
Code Size 912 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 4
AC × 14
TLE × 35
Set Name Test Cases
Sample example_0, example_1, example_2, example_3
All example_0, example_1, example_2, example_3, kimeuti_0, kimeuti_1, kimeuti_10, kimeuti_11, kimeuti_12, kimeuti_13, kimeuti_14, kimeuti_15, kimeuti_16, kimeuti_17, kimeuti_18, kimeuti_19, kimeuti_2, kimeuti_3, kimeuti_4, kimeuti_5, kimeuti_6, kimeuti_7, kimeuti_8, kimeuti_9, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_16, rand_17, rand_18, rand_19, rand_2, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9, small_0, small_1, small_2, small_3, small_4
Case Name Status Exec Time Memory
example_0 AC 1 ms 256 KB
example_1 AC 1 ms 256 KB
example_2 AC 1 ms 256 KB
example_3 AC 1 ms 256 KB
kimeuti_0 TLE 2103 ms 256 KB
kimeuti_1 TLE 2103 ms 256 KB
kimeuti_10 TLE 2103 ms 256 KB
kimeuti_11 TLE 2103 ms 256 KB
kimeuti_12 TLE 2103 ms 256 KB
kimeuti_13 TLE 2103 ms 256 KB
kimeuti_14 TLE 2103 ms 256 KB
kimeuti_15 AC 3 ms 256 KB
kimeuti_16 TLE 2103 ms 256 KB
kimeuti_17 TLE 2103 ms 256 KB
kimeuti_18 TLE 2103 ms 256 KB
kimeuti_19 TLE 2103 ms 256 KB
kimeuti_2 TLE 2103 ms 256 KB
kimeuti_3 TLE 2103 ms 256 KB
kimeuti_4 TLE 2103 ms 256 KB
kimeuti_5 TLE 2103 ms 256 KB
kimeuti_6 TLE 2103 ms 256 KB
kimeuti_7 TLE 2103 ms 256 KB
kimeuti_8 TLE 2103 ms 256 KB
kimeuti_9 TLE 2103 ms 256 KB
rand_0 TLE 2103 ms 256 KB
rand_1 TLE 2103 ms 256 KB
rand_10 TLE 2103 ms 256 KB
rand_11 AC 1 ms 256 KB
rand_12 TLE 2103 ms 256 KB
rand_13 AC 1 ms 256 KB
rand_14 TLE 2103 ms 256 KB
rand_15 TLE 2103 ms 256 KB
rand_16 TLE 2103 ms 256 KB
rand_17 TLE 2103 ms 256 KB
rand_18 TLE 2103 ms 256 KB
rand_19 TLE 2103 ms 256 KB
rand_2 TLE 2103 ms 256 KB
rand_3 AC 294 ms 256 KB
rand_4 TLE 2103 ms 256 KB
rand_5 TLE 2103 ms 256 KB
rand_6 TLE 2103 ms 256 KB
rand_7 AC 1 ms 256 KB
rand_8 TLE 2103 ms 256 KB
rand_9 TLE 2103 ms 256 KB
small_0 AC 1 ms 256 KB
small_1 AC 1 ms 256 KB
small_2 AC 1 ms 256 KB
small_3 AC 1 ms 256 KB
small_4 AC 1 ms 256 KB