oj.uz

Submission #345545

# Submission time Handle Problem Language Result Execution time Memory
345545 2021-01-07T14:44:30 Z Nursik Feast (NOI19_feast) C++14
12 / 100
 44 ms 4432 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end() 
#define ld long double

using namespace std; 
 
void data() {
	#ifdef NURS
        freopen("main.in", "r", stdin);
        freopen("main.out", "w", stdout);
    #endif	
} 
void win()
{	
	ios_base::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
}

int block = 400;
const ld eps = 1e-6; 

const int N = 1e6 + 500;
const int mod = 1e9 + 7;

const ll hh = 100010683;
const ll hh2 = 150005819;

int n, k, g, pos;
int a[N];
ll s, ans;
int main()
{
	data();              
	win();        
	cin >> n >> k;
	bool was = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		was = was | (a[i] < 0), s += a[i];
		if (a[i] < 0)
			g++, pos = i;
	}
	//first subtask
	if (was == 0)
	{
		cout << s << '\n';
		return 0;
	}
	//second subtask
	if (g == 1 && k >= 2)
	{
		cout << s - a[pos] << '\n';
		return 0;	
	}
	else if (g == 1 && k == 1)
	{
		ans = max(ans, s);
		s = 0;
		for (int i = 1; i < pos; i++)
			s += a[i];
		ans = max(ans, s), s = 0;
		for (int i = pos + 1; i <= n; i++)
			s += a[i];
		ans = max(ans, s);
		cout << ans << '\n';
		return 0;
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1516 KB Output is correct
2 Correct 34 ms 1516 KB Output is correct
3 Correct 35 ms 1516 KB Output is correct
4 Correct 35 ms 1516 KB Output is correct
5 Correct 34 ms 1516 KB Output is correct
6 Correct 34 ms 1516 KB Output is correct
7 Correct 36 ms 1536 KB Output is correct
8 Correct 37 ms 1476 KB Output is correct
9 Correct 43 ms 1516 KB Output is correct
10 Correct 35 ms 1580 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1516 KB Output is correct
2 Correct 25 ms 1516 KB Output is correct
3 Correct 28 ms 1516 KB Output is correct
4 Correct 25 ms 2668 KB Output is correct
5 Correct 44 ms 4332 KB Output is correct
6 Correct 23 ms 2668 KB Output is correct
7 Correct 24 ms 2668 KB Output is correct
8 Correct 38 ms 4432 KB Output is correct
9 Correct 37 ms 4332 KB Output is correct
10 Correct 24 ms 2668 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1516 KB Output is correct
2 Correct 34 ms 1516 KB Output is correct
3 Correct 35 ms 1516 KB Output is correct
4 Correct 35 ms 1516 KB Output is correct
5 Correct 34 ms 1516 KB Output is correct
6 Correct 34 ms 1516 KB Output is correct
7 Correct 36 ms 1536 KB Output is correct
8 Correct 37 ms 1476 KB Output is correct
9 Correct 43 ms 1516 KB Output is correct
10 Correct 35 ms 1580 KB Output is correct
11 Correct 30 ms 1516 KB Output is correct
12 Correct 25 ms 1516 KB Output is correct
13 Correct 28 ms 1516 KB Output is correct
14 Correct 25 ms 2668 KB Output is correct
15 Correct 44 ms 4332 KB Output is correct
16 Correct 23 ms 2668 KB Output is correct
17 Correct 24 ms 2668 KB Output is correct
18 Correct 38 ms 4432 KB Output is correct
19 Correct 37 ms 4332 KB Output is correct
20 Correct 24 ms 2668 KB Output is correct
21 Incorrect 39 ms 1516 KB Output isn't correct
22 Halted 0 ms 0 KB -