oj.uz

Submission #590588

# Submission time Handle Problem Language Result Execution time Memory
590588 2022-07-06T07:09:44 Z Jakub_Wozniak Potatoes and fertilizers (LMIO19_bulves) C++14
0 / 100
 18 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;
int bezw(int K)
{
	if(K<0){K*=-1;}
	return K;
}
int main()
{
	int N;
	cin >> N;
	int A[N] , B[N];
	
	for(int i=0;i<N;i++)
	{
		cin >> A[i] >> B[i];
	}
	int nadmiar=0,wynik=0;
	for(int i=0;i<N;i++)
	{
		nadmiar+=A[i]-B[i];
		wynik+=bezw(nadmiar);

		
	}
	cout <<wynik;
	return 0;
}

Subtask #1
0 / 24.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 36.0

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