oj.uz

Submission #300514

# Submission time Handle Problem Language Result Execution time Memory
300514 2020-09-17T08:26:02 Z Muhammetali Comparing Plants (IOI20_plants) C++11
5 / 100
 112 ms 5112 KB 
#include "plants.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
int n;
int jem[200001];
void init(int k, std::vector<int> r)
{
	n=sz(r);
	jem[0]=r[0];
	for (int i=1;i<sz(r);i++) jem[i]=jem[i-1]+r[i];
	return;
}

int compare_plants(int x, int y) {
	if (jem[y-1]-jem[x-1]==0 || (jem[n-1]-jem[y-1])+jem[x-1]==n-y+x)return 1;
	if (jem[y-1]-jem[x-1]==y-x || (jem[n-1]-jem[y-1])+jem[x-1]==0)return -1;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 62 ms 3192 KB Output is correct
7 Correct 78 ms 3320 KB Output is correct
8 Correct 102 ms 4984 KB Output is correct
9 Correct 105 ms 4984 KB Output is correct
10 Correct 103 ms 4984 KB Output is correct
11 Correct 104 ms 4984 KB Output is correct
12 Correct 103 ms 4984 KB Output is correct
13 Correct 105 ms 4984 KB Output is correct
14 Correct 112 ms 5112 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 62 ms 3192 KB Output is correct
7 Correct 78 ms 3320 KB Output is correct
8 Correct 102 ms 4984 KB Output is correct
9 Correct 105 ms 4984 KB Output is correct
10 Correct 103 ms 4984 KB Output is correct
11 Correct 104 ms 4984 KB Output is correct
12 Correct 103 ms 4984 KB Output is correct
13 Correct 105 ms 4984 KB Output is correct
14 Correct 112 ms 5112 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Incorrect 1 ms 256 KB Output isn't correct
18 Halted 0 ms 0 KB -