oj.uz

Submission #64655

# Submission time Handle Problem Language Result Execution time Memory
64655 2018-08-05T10:16:27 Z FLDutchman Horses (IOI15_horses) C++14
54 / 100
 1500 ms 156812 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

typedef int INT;

#define int long long
#define FOR(i, l, r) for(int i = (l); i < (r); i++)
#define pb push_back
#define fst first
#define snd second
#define LSB(k) k&-k

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

const int mod = 1e9+7;

struct segtree{
	vi t;
	segtree(int N){
		t.assign(4*N, 0);
	}	

	segtree(){}

	void update(int n){
		t[n] = max(t[n<<1], t[n<<1|1]);
	}

	void modify(int i, int v, int lb, int rb, int n = 1){
		if(lb + 1 == rb) {
			t[n] = v;
			return;
		}
		int mb = (lb+rb)/2;
		if(i < mb) modify(i, v, lb, mb, n<<1);
		else modify(i, v, mb, rb, n<<1|1);
		update(n);
	}

	int rmq(int l, int r, int lb, int rb, int n = 1){
		if(lb <= l and r <= rb) return t[n];
		int mb = (lb + rb)/2;
		int res = 0;
		if(l < mb) res = max(res, rmq(l, r, lb, mb, n<<1));
		if (r > mb) res = max(res, rmq(l, r, mb, rb, n<<1|1));
		return res;
	}
};

int mpow(int a, int b){
	if(b == 0) return 1;
	if(b == 1) return a;
	if(b & 1) return a * mpow(a*a%mod, b>>1) % mod;
	return mpow(a*a%mod, b>>1);
}

int N;
vi X, Xinv, Y;
segtree tree;
set<int> nonunit;
int prod;

int getBest(){
	//cout << prod << endl;
	int i = N-1;
	int y = Y[i];
	int p = prod;
	while(y < mod && i > 0){
		p = p * Xinv[i] % mod;
		y = max(y * X[i], Y[i-1]);
		i--;
	}
	y %= mod;
	//cout << p << " " << y << endl;
	return p * y % mod;
}

INT init(INT n, INT x[], INT y[]) {
	N = n;
	tree = segtree(N);
	prod = 1;
	FOR(i, 0, N) Y.pb(y[i]), X.pb(x[i]), tree.modify(i, y[i], 0, N), Xinv.pb(mpow(x[i], mod-2)), prod = prod * X[i] % mod;
	FOR(i, 0, N) if(X[i] != 1) nonunit.insert(i);
	return getBest();
}

INT updateX(INT pos, INT val) {	
	if(X[pos] != 1) nonunit.erase(pos);
	prod = prod * Xinv[pos] % mod * val % mod;
	X[pos] = val;
	Xinv[pos] = mpow(val, mod-2);
	if(val != 1) nonunit.insert(pos);
	return getBest();
}

INT updateY(INT pos, INT val) {
	Y[pos] = val;
	tree.modify(pos, val, 0, N);
	return getBest();
}

Compilation message

horses.cpp: In function 'INT init(INT, INT*, INT*)':
horses.cpp:87:16: warning: conversion to 'INT {aka int}' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~
horses.cpp: In function 'INT updateX(INT, INT)':
horses.cpp:96:16: warning: conversion to 'INT {aka int}' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~
horses.cpp: In function 'INT updateY(INT, INT)':
horses.cpp:102:16: warning: conversion to 'INT {aka int}' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 528 KB Output is correct
7 Correct 3 ms 564 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 1 ms 564 KB Output is correct
10 Correct 3 ms 564 KB Output is correct
11 Correct 3 ms 564 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 4 ms 588 KB Output is correct
17 Correct 0 ms 588 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 56732 KB Output is correct
2 Correct 660 ms 56732 KB Output is correct
3 Correct 631 ms 60564 KB Output is correct
4 Correct 772 ms 68180 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 68180 KB Output is correct
2 Correct 3 ms 68180 KB Output is correct
3 Correct 3 ms 68180 KB Output is correct
4 Correct 3 ms 68180 KB Output is correct
5 Correct 3 ms 68180 KB Output is correct
6 Correct 2 ms 68180 KB Output is correct
7 Correct 3 ms 68180 KB Output is correct
8 Correct 3 ms 68180 KB Output is correct
9 Correct 3 ms 68180 KB Output is correct
10 Correct 3 ms 68180 KB Output is correct
11 Correct 3 ms 68180 KB Output is correct
12 Correct 3 ms 68180 KB Output is correct
13 Correct 4 ms 68180 KB Output is correct
14 Correct 3 ms 68180 KB Output is correct
15 Correct 3 ms 68180 KB Output is correct
16 Correct 3 ms 68180 KB Output is correct
17 Correct 3 ms 68180 KB Output is correct
18 Correct 3 ms 68180 KB Output is correct
19 Correct 3 ms 68180 KB Output is correct
20 Correct 3 ms 68180 KB Output is correct
21 Correct 3 ms 68180 KB Output is correct
22 Correct 2 ms 68180 KB Output is correct
23 Correct 3 ms 68180 KB Output is correct
24 Correct 4 ms 68180 KB Output is correct
25 Correct 3 ms 68180 KB Output is correct
26 Correct 6 ms 68180 KB Output is correct
27 Correct 7 ms 68180 KB Output is correct
28 Correct 6 ms 68180 KB Output is correct
29 Correct 11 ms 68180 KB Output is correct
30 Correct 6 ms 68180 KB Output is correct
31 Correct 11 ms 68180 KB Output is correct
32 Correct 8 ms 68180 KB Output is correct
33 Correct 355 ms 68180 KB Output is correct
34 Correct 275 ms 68180 KB Output is correct
35 Correct 508 ms 86328 KB Output is correct
36 Correct 511 ms 97244 KB Output is correct
37 Execution timed out 1541 ms 97244 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 97244 KB Output is correct
2 Correct 3 ms 97244 KB Output is correct
3 Correct 3 ms 97244 KB Output is correct
4 Correct 4 ms 97244 KB Output is correct
5 Correct 3 ms 97244 KB Output is correct
6 Correct 2 ms 97244 KB Output is correct
7 Correct 3 ms 97244 KB Output is correct
8 Correct 3 ms 97244 KB Output is correct
9 Correct 3 ms 97244 KB Output is correct
10 Correct 2 ms 97244 KB Output is correct
11 Correct 2 ms 97244 KB Output is correct
12 Correct 3 ms 97244 KB Output is correct
13 Correct 3 ms 97244 KB Output is correct
14 Correct 2 ms 97244 KB Output is correct
15 Correct 2 ms 97244 KB Output is correct
16 Correct 4 ms 97244 KB Output is correct
17 Correct 3 ms 97244 KB Output is correct
18 Correct 2 ms 97244 KB Output is correct
19 Correct 3 ms 97244 KB Output is correct
20 Correct 3 ms 97244 KB Output is correct
21 Correct 3 ms 97244 KB Output is correct
22 Correct 3 ms 97244 KB Output is correct
23 Correct 4 ms 97244 KB Output is correct
24 Correct 6 ms 97244 KB Output is correct
25 Correct 5 ms 97244 KB Output is correct
26 Correct 5 ms 97244 KB Output is correct
27 Correct 7 ms 97244 KB Output is correct
28 Correct 6 ms 97244 KB Output is correct
29 Correct 11 ms 97244 KB Output is correct
30 Correct 6 ms 97244 KB Output is correct
31 Correct 10 ms 97244 KB Output is correct
32 Correct 8 ms 97244 KB Output is correct
33 Correct 534 ms 104172 KB Output is correct
34 Correct 681 ms 116724 KB Output is correct
35 Correct 628 ms 120476 KB Output is correct
36 Correct 744 ms 128108 KB Output is correct
37 Correct 379 ms 128108 KB Output is correct
38 Correct 269 ms 128108 KB Output is correct
39 Correct 526 ms 145924 KB Output is correct
40 Correct 504 ms 156812 KB Output is correct
41 Execution timed out 1533 ms 156812 KB Time limit exceeded
42 Halted 0 ms 0 KB -