oj.uz

Submission #43558

# Submission time Handle Problem Language Result Execution time Memory
43558 2018-03-17T18:58:39 Z PowerOfNinjaGo Horses (IOI15_horses) C++14
17 / 100
 1455 ms 41296 KB 
//Power Of Ninja Go
#include <bits/stdc++.h>
#ifdef atom
#include "grader.cpp"
#else
#include "horses.h"
#endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vii vector< ii >
#define pb push_back
const int maxn = 500005;
const int md = 1e9 + 7;
int prod[4*maxn];
int most[4*maxn];
int x[4*maxn];
int y[4*maxn];
int n;
int mul(int a, int b)
{
	return (1LL*a*b)%md;
}
void update(int *st, int x, int dx, int md, int p = 1, int L = 1, int R = n)
{
	if(L> x || R< x) return;
	if(L == R && L == x)
	{
		st[p] = dx;
		return;
	}
	int M = (L+R)/2;
	//printf("%d %d %d\n", L, R, M);
	//system("pause");
	update(st, x, dx, md, 2*p, L, M); update(st, x, dx, md, 2*p+1, M+1, R);
	if(md == 1) st[p] = mul(st[2*p], st[2*p+1]);
	else st[p] = max(st[2*p], st[2*p+1]);
}
int ask(int *st, int i, int j, int md, int p = 1, int L = 1, int R = n)
{
	if(i> R || j< L) return 1;
	if(i<= L && R<= j) return st[p];
	int M = (L+R)/2;
	int x = ask(st, i, j, md, 2*p, L, M);
	int y = ask(st, i, j, md, 2*p+1, M+1, R);
	if(md == 1) return mul(x, y);
	else return max(x, y);
}
set<int> bst;
int query()
{
	int cnt = 30;
	vi tmp;
	for(auto it = bst.rbegin(); it != bst.rend() && cnt; it++)
	{
		tmp.pb(*it);
		cnt--;
	}
	reverse(tmp.begin(), tmp.end());
	if(tmp.empty()) return ask(most, 1, n, 2);
	ll best = ask(most, 1, tmp[0]-1, 2);
	ll run = 1;
	int q = tmp.size();
	for(int i = 0; i< q; i++)
	{
		//printf("%d", tmp[i]);
		run *= x[tmp[i]];
		int rend = i+1<q?tmp[i+1]:n+1;
		best = max(best, run*ask(most, tmp[i], rend-1, 2));
		//printf("(%d)", run*ask(most, tmp[i], rend-1, 2));
	}
	//printf("\n");
	return mul(best, ask(prod, 1, tmp[0]-1, 1));
}
int init(int N, int X[], int Y[])
{
	n = N;
	for(int i = 1; i<= n; i++) x[i] = X[i-1], y[i] = Y[i-1];
	for(int i = 1; i<= N; i++) update(prod, i, x[i], 1);
	for(int i = 1; i<= N; i++) update(most, i, y[i], 2);
	for(int i = 1; i<= N; i++) if(x[i]> 1) bst.insert(i);
	return query();
}
int updateX(int pos, int val)
{
	pos++;
	x[pos] = val;
	if(val> 1) bst.insert(pos);
	else bst.erase(pos);
	update(prod, pos, val, 1);
	return query();
}
int updateY(int pos, int val)
{
	pos++;
	y[pos] = val;
	update(most, pos, val, 2);
	return query();
}

Compilation message

horses.cpp: In function 'int mul(int, int)':
horses.cpp:24:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return (1LL*a*b)%md;
                   ^
horses.cpp: In function 'void update(int*, int, int, int, int, int, int)':
horses.cpp:26:76: warning: declaration of 'md' shadows a global declaration [-Wshadow]
 void update(int *st, int x, int dx, int md, int p = 1, int L = 1, int R = n)
                                                                            ^
horses.cpp:16:11: note: shadowed declaration is here
 const int md = 1e9 + 7;
           ^
horses.cpp:26:76: warning: declaration of 'x' shadows a global declaration [-Wshadow]
 void update(int *st, int x, int dx, int md, int p = 1, int L = 1, int R = n)
                                                                            ^
horses.cpp:19:5: note: shadowed declaration is here
 int x[4*maxn];
     ^
horses.cpp: In function 'int ask(int*, int, int, int, int, int, int)':
horses.cpp:41:71: warning: declaration of 'md' shadows a global declaration [-Wshadow]
 int ask(int *st, int i, int j, int md, int p = 1, int L = 1, int R = n)
                                                                       ^
horses.cpp:16:11: note: shadowed declaration is here
 const int md = 1e9 + 7;
           ^
horses.cpp:46:6: warning: declaration of 'x' shadows a global declaration [-Wshadow]
  int x = ask(st, i, j, md, 2*p, L, M);
      ^
horses.cpp:19:5: note: shadowed declaration is here
 int x[4*maxn];
     ^
horses.cpp:47:6: warning: declaration of 'y' shadows a global declaration [-Wshadow]
  int y = ask(st, i, j, md, 2*p+1, M+1, R);
      ^
horses.cpp:20:5: note: shadowed declaration is here
 int y[4*maxn];
     ^
horses.cpp: In function 'int query()':
horses.cpp:65:19: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
  int q = tmp.size();
                   ^
horses.cpp:75:44: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return mul(best, ask(prod, 1, tmp[0]-1, 1));
                                            ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 480 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 1 ms 612 KB Output is correct
5 Correct 1 ms 612 KB Output is correct
6 Correct 1 ms 612 KB Output is correct
7 Correct 1 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 1 ms 624 KB Output is correct
11 Correct 1 ms 624 KB Output is correct
12 Correct 1 ms 624 KB Output is correct
13 Correct 1 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 1 ms 624 KB Output is correct
16 Correct 1 ms 624 KB Output is correct
17 Correct 2 ms 624 KB Output is correct
18 Correct 1 ms 624 KB Output is correct
19 Correct 3 ms 624 KB Output is correct
20 Correct 1 ms 624 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 624 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 1 ms 624 KB Output is correct
4 Correct 1 ms 624 KB Output is correct
5 Correct 1 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 1 ms 624 KB Output is correct
8 Correct 1 ms 624 KB Output is correct
9 Correct 1 ms 624 KB Output is correct
10 Correct 1 ms 624 KB Output is correct
11 Correct 1 ms 624 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 1 ms 624 KB Output is correct
14 Correct 1 ms 624 KB Output is correct
15 Correct 1 ms 624 KB Output is correct
16 Correct 2 ms 624 KB Output is correct
17 Correct 1 ms 624 KB Output is correct
18 Correct 2 ms 624 KB Output is correct
19 Correct 1 ms 624 KB Output is correct
20 Correct 1 ms 624 KB Output is correct
21 Incorrect 1 ms 624 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 41296 KB Output is correct
2 Correct 1 ms 41296 KB Output is correct
3 Correct 2 ms 41296 KB Output is correct
4 Correct 1 ms 41296 KB Output is correct
5 Correct 1 ms 41296 KB Output is correct
6 Correct 1 ms 41296 KB Output is correct
7 Correct 1 ms 41296 KB Output is correct
8 Correct 1 ms 41296 KB Output is correct
9 Correct 2 ms 41296 KB Output is correct
10 Correct 1 ms 41296 KB Output is correct
11 Correct 1 ms 41296 KB Output is correct
12 Correct 1 ms 41296 KB Output is correct
13 Correct 2 ms 41296 KB Output is correct
14 Correct 1 ms 41296 KB Output is correct
15 Correct 1 ms 41296 KB Output is correct
16 Correct 1 ms 41296 KB Output is correct
17 Correct 1 ms 41296 KB Output is correct
18 Correct 1 ms 41296 KB Output is correct
19 Correct 2 ms 41296 KB Output is correct
20 Correct 2 ms 41296 KB Output is correct
21 Incorrect 2 ms 41296 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 41296 KB Output is correct
2 Correct 1 ms 41296 KB Output is correct
3 Correct 2 ms 41296 KB Output is correct
4 Correct 1 ms 41296 KB Output is correct
5 Correct 2 ms 41296 KB Output is correct
6 Correct 1 ms 41296 KB Output is correct
7 Correct 1 ms 41296 KB Output is correct
8 Correct 1 ms 41296 KB Output is correct
9 Correct 1 ms 41296 KB Output is correct
10 Correct 2 ms 41296 KB Output is correct
11 Correct 1 ms 41296 KB Output is correct
12 Correct 1 ms 41296 KB Output is correct
13 Correct 2 ms 41296 KB Output is correct
14 Correct 1 ms 41296 KB Output is correct
15 Correct 2 ms 41296 KB Output is correct
16 Correct 1 ms 41296 KB Output is correct
17 Correct 1 ms 41296 KB Output is correct
18 Correct 1 ms 41296 KB Output is correct
19 Correct 1 ms 41296 KB Output is correct
20 Correct 1 ms 41296 KB Output is correct
21 Incorrect 2 ms 41296 KB Output isn't correct
22 Halted 0 ms 0 KB -