oj.uz

Submission #58489

# Submission time Handle Problem Language Result Execution time Memory
58489 2018-07-18T03:21:47 Z E869120 Horses (IOI15_horses) C++14
57 / 100
 1500 ms 42116 KB 
#include "horses.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

class RangeMax {
public:
	vector<int>dat; int size_ = 0;
	void init(int sz) {
		size_ = 1;
		while (size_ <= sz) size_ *= 2;
		dat.resize(size_ * 2, 0);
	}
	void update(int p, int x) {
		p += size_; dat[p] = x; p >>= 1;
		while (p >= 1) { dat[p] = max(dat[p * 2], dat[p * 2 + 1]); p >>= 1; }
	}
	int getmax_(int l, int r, int a, int b, int u) {
		if (b <= l || r <= a) return -1;
		if (l <= a && b <= r) return dat[u];
		return max(getmax_(l, r, a, (a + b) >> 1, u * 2), getmax_(l, r, (a + b) >> 1, b, u * 2 + 1));
	}
	int getmax(int l, int r) {
		return getmax_(l, r, 0, size_, 1);
	}
};

int bit[500009];
void add(int pos, int x) {
	pos++;
	while (pos < 500009) { bit[pos] += x; pos += (pos&-pos); }
}
int sum(int pos) {
	int s = 0; pos++;
	while (pos >= 1) { s += bit[pos]; pos -= (pos&-pos); }
	return s;
}

long long N, X[500009], Y[500009], Allval = 0, mod = 1000000007;
RangeMax Q;

long long modpow(long long a, long long b, long long m) {
	long long p = 1, q = a;
	for (int i = 0; i < 31; i++) {
		if ((b&(1LL << i)) != 0) { p *= q; p %= m; }
		q *= q; q %= m;
	}
	return p;
}

long long Div(long long a, long long b, long long m) {
	return (1LL * a*modpow(b, m - 2, m)) % m;
}

int solve() {
	pair<int, int>maxid = make_pair(0, 1);

	long long P = 1, cx = N - 1;
	while (true) {
		long long L = 0, R = cx + 1, M, I = sum(cx), maxn = 0;
		for (int i = 0; i < 24; i++) {
			M = (L + R) / 2;
			if (I - sum(M - 1) >= 1) { maxn = max(maxn, M); L = M; }
			else R = M;
		}
		long long YY = Q.getmax(M, cx + 1);
		if (maxid.first * P < maxid.second * YY) maxid = make_pair(YY, P);
		P *= X[M]; cx = M - 1;
		if (P > (1LL << 30) || cx < 0) break;
	}

	long long J = Div(Allval, maxid.second, mod);
	J *= maxid.first; J %= mod;
	return J;
}

int init(int NN, int XX[], int YY[]) {
	N = NN; Allval = 1; Q.init(N + 2);
	for (int i = 0; i < N; i++) { X[i] = XX[i]; Allval *= X[i]; Allval %= mod; if (X[i] >= 2) add(i, 1); }
	for (int i = 0; i < N; i++) { Y[i] = YY[i]; Q.update(i, Y[i]); }
	return solve();
}

int updateX(int pos, int val) {	
	Allval = Div(Allval, X[pos], mod); if (X[pos] >= 2) add(pos, -1);
	X[pos] = val;
	Allval *= X[pos]; Allval %= mod; if (X[pos] >= 2) add(pos, 1);
	return solve();
}

int updateY(int pos, int val) {
	Y[pos] = val; Q.update(pos, Y[pos]);
	return solve();
}

Compilation message

horses.cpp: In function 'int solve()':
horses.cpp:61:45: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   long long L = 0, R = cx + 1, M, I = sum(cx), maxn = 0;
                                             ^
horses.cpp:64:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
    if (I - sum(M - 1) >= 1) { maxn = max(maxn, M); L = M; }
                ~~^~~
horses.cpp:67:36: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   long long YY = Q.getmax(M, cx + 1);
                                    ^
horses.cpp:67:33: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   long long YY = Q.getmax(M, cx + 1);
                              ~~~^~~
horses.cpp:75:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return J;
         ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:79:31: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  N = NN; Allval = 1; Q.init(N + 2);
                             ~~^~~
horses.cpp:81:61: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for (int i = 0; i < N; i++) { Y[i] = YY[i]; Q.update(i, Y[i]); }
                                                          ~~~^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:93:35: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  Y[pos] = val; Q.update(pos, Y[pos]);
                              ~~~~~^

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 744 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 2 ms 744 KB Output is correct
4 Correct 3 ms 744 KB Output is correct
5 Correct 2 ms 744 KB Output is correct
6 Correct 2 ms 744 KB Output is correct
7 Correct 2 ms 744 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 2 ms 760 KB Output is correct
19 Correct 3 ms 760 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 2 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 7 ms 760 KB Output is correct
26 Correct 6 ms 760 KB Output is correct
27 Correct 18 ms 760 KB Output is correct
28 Correct 9 ms 760 KB Output is correct
29 Correct 5 ms 760 KB Output is correct
30 Correct 6 ms 760 KB Output is correct
31 Correct 13 ms 760 KB Output is correct
32 Correct 18 ms 812 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1564 ms 19324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19324 KB Output is correct
2 Correct 2 ms 19324 KB Output is correct
3 Correct 2 ms 19324 KB Output is correct
4 Correct 2 ms 19324 KB Output is correct
5 Correct 3 ms 19324 KB Output is correct
6 Correct 2 ms 19324 KB Output is correct
7 Correct 3 ms 19324 KB Output is correct
8 Correct 3 ms 19324 KB Output is correct
9 Correct 2 ms 19324 KB Output is correct
10 Correct 3 ms 19324 KB Output is correct
11 Correct 2 ms 19324 KB Output is correct
12 Correct 2 ms 19324 KB Output is correct
13 Correct 2 ms 19324 KB Output is correct
14 Correct 3 ms 19324 KB Output is correct
15 Correct 3 ms 19324 KB Output is correct
16 Correct 3 ms 19324 KB Output is correct
17 Correct 3 ms 19324 KB Output is correct
18 Correct 3 ms 19324 KB Output is correct
19 Correct 2 ms 19324 KB Output is correct
20 Correct 2 ms 19324 KB Output is correct
21 Correct 2 ms 19324 KB Output is correct
22 Correct 3 ms 19324 KB Output is correct
23 Correct 6 ms 19324 KB Output is correct
24 Correct 6 ms 19324 KB Output is correct
25 Correct 8 ms 19324 KB Output is correct
26 Correct 4 ms 19324 KB Output is correct
27 Correct 14 ms 19324 KB Output is correct
28 Correct 8 ms 19324 KB Output is correct
29 Correct 5 ms 19324 KB Output is correct
30 Correct 6 ms 19324 KB Output is correct
31 Correct 13 ms 19324 KB Output is correct
32 Correct 16 ms 19324 KB Output is correct
33 Correct 100 ms 19324 KB Output is correct
34 Correct 91 ms 19324 KB Output is correct
35 Correct 146 ms 19324 KB Output is correct
36 Correct 140 ms 19324 KB Output is correct
37 Correct 280 ms 19324 KB Output is correct
38 Correct 133 ms 19324 KB Output is correct
39 Correct 93 ms 19324 KB Output is correct
40 Correct 125 ms 24568 KB Output is correct
41 Correct 202 ms 24992 KB Output is correct
42 Correct 275 ms 26904 KB Output is correct
43 Correct 120 ms 35072 KB Output is correct
44 Correct 101 ms 41340 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 41340 KB Output is correct
2 Correct 2 ms 41340 KB Output is correct
3 Correct 2 ms 41340 KB Output is correct
4 Correct 2 ms 41340 KB Output is correct
5 Correct 2 ms 41340 KB Output is correct
6 Correct 2 ms 41340 KB Output is correct
7 Correct 2 ms 41340 KB Output is correct
8 Correct 3 ms 41340 KB Output is correct
9 Correct 3 ms 41340 KB Output is correct
10 Correct 3 ms 41340 KB Output is correct
11 Correct 4 ms 41340 KB Output is correct
12 Correct 3 ms 41340 KB Output is correct
13 Correct 2 ms 41340 KB Output is correct
14 Correct 2 ms 41340 KB Output is correct
15 Correct 2 ms 41340 KB Output is correct
16 Correct 3 ms 41340 KB Output is correct
17 Correct 2 ms 41340 KB Output is correct
18 Correct 2 ms 41340 KB Output is correct
19 Correct 3 ms 41340 KB Output is correct
20 Correct 2 ms 41340 KB Output is correct
21 Correct 3 ms 41340 KB Output is correct
22 Correct 3 ms 41340 KB Output is correct
23 Correct 8 ms 41340 KB Output is correct
24 Correct 5 ms 41340 KB Output is correct
25 Correct 6 ms 41340 KB Output is correct
26 Correct 5 ms 41340 KB Output is correct
27 Correct 15 ms 41340 KB Output is correct
28 Correct 8 ms 41340 KB Output is correct
29 Correct 5 ms 41340 KB Output is correct
30 Correct 6 ms 41340 KB Output is correct
31 Correct 13 ms 41340 KB Output is correct
32 Correct 17 ms 41340 KB Output is correct
33 Execution timed out 1566 ms 42116 KB Time limit exceeded
34 Halted 0 ms 0 KB -