oj.uz

Submission #62938

# Submission time Handle Problem Language Result Execution time Memory
62938 2018-07-31T01:27:39 Z updown1 Horses (IOI15_horses) C++17
17 / 100
 834 ms 48756 KB 
/*
segtree. Each element i stores (X[0]*X[1]*...*X[i]*Y[i])%MOD
*/
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N1)
#define ffj For(j, 0, P)
#define ffa ffi ffj
//#define s <<" "<<
//#define c <<" : "<<
#define w cout
#define e endl
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const ll MAXN = 500000, MOD = 1000000007;
int N1;
ll tree[4*MAXN+1], lazy[4*MAXN+1], xx[MAXN], yy[MAXN];

ll mI(ll x, ll y) { /// call mI(x, MOD-2)
    /// x^y
    if (y == 0) return 1;
    if (y == 1) return x;
    ll p = mI(x, y/2);
    p = (p*p)%MOD;
    if (y%2 == 1) p = (p*x)%MOD;
    return p;
}

void push(int x, int L, int R) {
    tree[x] *= lazy[x];
    tree[x] %= MOD;
    if (L != R) {
        lazy[x*2] *= lazy[x];
        lazy[x*2] %= MOD;
        lazy[x*2+1] *= lazy[x];
        lazy[x*2+1] %= MOD;
    }
    lazy[x] = 1;
}
void update(int x, int L, int R, int oL, int oR, ll v) {
    push(x, L, R);
    if (R < oL || oR < L) return;
    if (oL <= L && R <= oR) {
        lazy[x] *= v;
        lazy[x] %= MOD;
        push(x, L, R);
        return;
    }
    update(x*2, L, (L+R)/2, oL, oR, v);
    update(x*2+1,(L+R)/2+1,R,oL, oR, v);
    tree[x] = max(tree[x*2], tree[x*2+1]);
}
int answer() {
    push(1, 0, N1-1);
    return tree[1];
}

int init(int N, int X[], int Y[]) {
    N1 = N;
    For (i, 0, 4*MAXN+1) tree[i] = lazy[i] = 1;
    ffi xx[i] = X[i], yy[i] = Y[i];
    ffi update(1, 0, N-1, i, N-1, X[i]), update(1, 0, N-1, i, i, Y[i]);
    return answer();
}
int updateX(int pos, int val) {
    update(1, 0, N1-1, pos, N1-1, mI(xx[pos], MOD-2));
    update(1, 0, N1-1, pos, N1-1, val);
    xx[pos] = val;
	return answer();
}
int updateY(int pos, int val) {
    update(1, 0, N1-1, pos, pos, mI(yy[pos], MOD-2));
    update(1, 0, N1-1, pos, pos, val);
    yy[pos] = val;
	return answer();
}

/*
static char _buffer[1024];
static int _currentChar = 0;
static int _charsNumber = 0;
static FILE *_inputFile, *_outputFile;
static inline int _read() {
    if (_charsNumber < 0) {
        exit(1);
    }
    if (!_charsNumber || _currentChar == _charsNumber) {
        _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
        _currentChar = 0;
    }
    if (_charsNumber <= 0) {
        return -1;
    }
    return _buffer[_currentChar++];
}
static inline int _readInt() {
    int c, x, s;
    c = _read();
    while (c <= 32) c = _read();
    x = 0;
    s = 1;
    if (c == '-') {
        s = -1;
        c = _read();
    }
    while (c > 32) {
        x *= 10;
        x += c - '0';
        c = _read();
    }
    if (s < 0) x = -x;
    return x;
}
int main() {
	_inputFile = fopen("test.in", "rb");
	//_outputFile = fopen("horses.out", "w");

	int N; N = _readInt();

	int *X = (int*)malloc(sizeof(int)*(unsigned int)N);
	int *Y = (int*)malloc(sizeof(int)*(unsigned int)N);

	for (int i = 0; i < N; i++) {
		X[i] = _readInt();
	}

	for (int i = 0; i < N; i++) {
		Y[i] = _readInt();
	}

	printf("%d\n",init(N,X,Y));

	int M; M = _readInt();

	for (int i = 0; i < M; i++) {
		int type; type = _readInt();
		int pos; pos = _readInt();
		int val; val = _readInt();

		if (type == 1) {
			printf("%d\n",updateX(pos,val));
		} else if (type == 2) {
			printf("%d\n",updateY(pos,val));
		}
	}
}
*/

Compilation message

horses.cpp: In function 'int answer()':
horses.cpp:61:18: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     return tree[1];
            ~~~~~~^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 31672 KB Output is correct
2 Correct 26 ms 31732 KB Output is correct
3 Correct 25 ms 31796 KB Output is correct
4 Correct 30 ms 31840 KB Output is correct
5 Correct 29 ms 32020 KB Output is correct
6 Correct 26 ms 32020 KB Output is correct
7 Correct 27 ms 32020 KB Output is correct
8 Correct 25 ms 32020 KB Output is correct
9 Correct 35 ms 32020 KB Output is correct
10 Correct 28 ms 32020 KB Output is correct
11 Correct 29 ms 32020 KB Output is correct
12 Correct 26 ms 32020 KB Output is correct
13 Correct 26 ms 32020 KB Output is correct
14 Correct 25 ms 32020 KB Output is correct
15 Correct 32 ms 32020 KB Output is correct
16 Correct 31 ms 32020 KB Output is correct
17 Correct 30 ms 32020 KB Output is correct
18 Correct 34 ms 32020 KB Output is correct
19 Correct 29 ms 32020 KB Output is correct
20 Correct 31 ms 32020 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 32020 KB Output is correct
2 Correct 31 ms 32020 KB Output is correct
3 Correct 30 ms 32020 KB Output is correct
4 Correct 34 ms 32020 KB Output is correct
5 Correct 29 ms 32020 KB Output is correct
6 Correct 29 ms 32020 KB Output is correct
7 Correct 30 ms 32100 KB Output is correct
8 Correct 29 ms 32100 KB Output is correct
9 Correct 28 ms 32100 KB Output is correct
10 Correct 30 ms 32100 KB Output is correct
11 Correct 29 ms 32100 KB Output is correct
12 Correct 32 ms 32100 KB Output is correct
13 Correct 30 ms 32100 KB Output is correct
14 Correct 36 ms 32100 KB Output is correct
15 Correct 29 ms 32100 KB Output is correct
16 Correct 31 ms 32100 KB Output is correct
17 Correct 30 ms 32100 KB Output is correct
18 Correct 29 ms 32100 KB Output is correct
19 Correct 30 ms 32100 KB Output is correct
20 Correct 27 ms 32100 KB Output is correct
21 Incorrect 27 ms 32100 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 48756 KB Output is correct
2 Correct 28 ms 48756 KB Output is correct
3 Correct 31 ms 48756 KB Output is correct
4 Correct 29 ms 48756 KB Output is correct
5 Correct 27 ms 48756 KB Output is correct
6 Correct 34 ms 48756 KB Output is correct
7 Correct 37 ms 48756 KB Output is correct
8 Correct 28 ms 48756 KB Output is correct
9 Correct 30 ms 48756 KB Output is correct
10 Correct 25 ms 48756 KB Output is correct
11 Correct 25 ms 48756 KB Output is correct
12 Correct 27 ms 48756 KB Output is correct
13 Correct 25 ms 48756 KB Output is correct
14 Correct 33 ms 48756 KB Output is correct
15 Correct 30 ms 48756 KB Output is correct
16 Correct 30 ms 48756 KB Output is correct
17 Correct 32 ms 48756 KB Output is correct
18 Correct 27 ms 48756 KB Output is correct
19 Correct 25 ms 48756 KB Output is correct
20 Correct 26 ms 48756 KB Output is correct
21 Incorrect 25 ms 48756 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 48756 KB Output is correct
2 Correct 25 ms 48756 KB Output is correct
3 Correct 27 ms 48756 KB Output is correct
4 Correct 31 ms 48756 KB Output is correct
5 Correct 37 ms 48756 KB Output is correct
6 Correct 29 ms 48756 KB Output is correct
7 Correct 29 ms 48756 KB Output is correct
8 Correct 28 ms 48756 KB Output is correct
9 Correct 34 ms 48756 KB Output is correct
10 Correct 30 ms 48756 KB Output is correct
11 Correct 30 ms 48756 KB Output is correct
12 Correct 25 ms 48756 KB Output is correct
13 Correct 33 ms 48756 KB Output is correct
14 Correct 30 ms 48756 KB Output is correct
15 Correct 30 ms 48756 KB Output is correct
16 Correct 29 ms 48756 KB Output is correct
17 Correct 28 ms 48756 KB Output is correct
18 Correct 26 ms 48756 KB Output is correct
19 Correct 28 ms 48756 KB Output is correct
20 Correct 25 ms 48756 KB Output is correct
21 Incorrect 30 ms 48756 KB Output isn't correct
22 Halted 0 ms 0 KB -