oj.uz

Submission #431114

# Submission time Handle Problem Language Result Execution time Memory
431114 2021-06-17T09:45:44 Z Blistering_Barnacles Comparing Plants (IOI20_plants) C++11
5 / 100
 103 ms 18120 KB 
#include "plants.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void init(int k, vector<int> r) {
	n = sz(r) ;
	for(ll i = 1 ; i <= n ; i++){
        a[i] = a[i - 1] + r[i - 1] ;
	}
}

int compare_plants(int x, int y) {
	o = a[y] - a[x] ;
	p = a[n] - a[y] + a[x] ;
	if(!o)R 1 ;
	else if(o == y - x) R -1 ;
	if(!p)R -1 ;
	else if(p == n - y + x) R 1 ;
	R 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13260 KB Output is correct
3 Correct 10 ms 13260 KB Output is correct
4 Correct 8 ms 13260 KB Output is correct
5 Correct 10 ms 13260 KB Output is correct
6 Correct 67 ms 16088 KB Output is correct
7 Correct 75 ms 16336 KB Output is correct
8 Correct 101 ms 18016 KB Output is correct
9 Correct 99 ms 17996 KB Output is correct
10 Correct 101 ms 18020 KB Output is correct
11 Correct 97 ms 18008 KB Output is correct
12 Correct 103 ms 18120 KB Output is correct
13 Correct 96 ms 17984 KB Output is correct
14 Correct 95 ms 18008 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13260 KB Output is correct
3 Correct 10 ms 13260 KB Output is correct
4 Correct 8 ms 13260 KB Output is correct
5 Correct 10 ms 13260 KB Output is correct
6 Correct 67 ms 16088 KB Output is correct
7 Correct 75 ms 16336 KB Output is correct
8 Correct 101 ms 18016 KB Output is correct
9 Correct 99 ms 17996 KB Output is correct
10 Correct 101 ms 18020 KB Output is correct
11 Correct 97 ms 18008 KB Output is correct
12 Correct 103 ms 18120 KB Output is correct
13 Correct 96 ms 17984 KB Output is correct
14 Correct 95 ms 18008 KB Output is correct
15 Correct 8 ms 13260 KB Output is correct
16 Correct 8 ms 13280 KB Output is correct
17 Incorrect 8 ms 13260 KB Output isn't correct
18 Halted 0 ms 0 KB -