oj.uz

답안 #984267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984267 2024-05-16T12:17:05 Z LucaIlie 말 (IOI15_horses) C++17
34 / 100
 1500 ms 58124 KB 
#include "horses.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5e5;
const int MOD = 1e9 + 7;

struct AIB1 {
    int aib[MAX_N + 1];

    void init() {
        for ( int i = 0; i <= MAX_N; i++ )
            aib[i] = 1;
    }

    void update( int i, int x ) {
        while ( i <= MAX_N ) {
            aib[i] = (long long)aib[i] * x % MOD;
            i += (i & -i);
        }
    }

    int query( int i ) {
        int p = 1;
        while ( i > 0 ) {
            p = (long long)p * aib[i] % MOD;
            i -= (i & -i);
        }
        return p;
    }
} horses;

struct AIB2 {
    long double aib[MAX_N + 1];

    void init() {
        for ( int i = 0; i <= MAX_N; i++ )
            aib[i] = 0;
    }

    void update( int i, long double x ) {
        while ( i <= MAX_N ) {
            aib[i] += x;
            i += (i & -i);
        }
    }

    long double query( int i ) {
        long double p = 0;
        while ( i > 0 ) {
            p += aib[i];
            i -= (i & -i);
        }
        return p;
    }
} cost;

int lgPut( int a, int n ) {
    if ( n == 0 )
        return 1;

    int p = lgPut( a, n / 2 );
    p = (long long)p * p % MOD;
    if ( n % 2 == 1 )
        p = (long long)p * a % MOD;

    return p;
}

int inv( int x ) {
    return lgPut( x, MOD - 2 );
}

int n;
int x[MAX_N + 1], y[MAX_N + 1];
set<pair<long double, int>> s;


void calc() {
    s.clear();
    horses.init();
    cost.init();
    for ( int i = 1; i <= n; i++ ) {
        horses.update( i, x[i] );
        cost.update( i, log( x[i] ) );
        s.insert( { cost.query( i ) + log( y[i] ), i } );
    }
}
void calc2() {
    s.clear();
    for ( int i = 1; i <= n; i++ ) {
        s.insert( { cost.query( i ) + log( y[i] ), i } );
    }
}

int answer() {
    int i = s.rbegin()->second;
    return (long long)horses.query( i ) * y[i] % MOD;
}

int init( int N, int X[], int Y[] ) {
    n = N;

    for ( int i = n - 1; i >= 0; i-- )
        x[i + 1] = X[i], y[i + 1] = Y[i];


    calc();
    return answer();
}

int updateX( int pos, int val ) {
    int i = pos + 1;

    s.erase( { cost.query( i ) + log( y[i] ), i } );
    cost.update( i, -log( x[i] ) );
    horses.update( i, inv( x[i] ) );

    x[i] = val;

    cost.update( i, log( x[i] ) );
    horses.update( i, x[i] );
    s.insert( { cost.query( i ) + log( y[i] ), i } );
calc2();
    return answer();
}

int updateY( int pos, int val ) {
    int i = pos + 1;

    s.erase( { cost.query( i ) + log( y[i] ), i } );
    y[i] = val;
    s.insert( { cost.query( i ) + log( y[i] ), i } );


    return answer();
}

Compilation message

horses.cpp: In member function 'void AIB1::update(int, int)':
horses.cpp:19:44: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   19 |             aib[i] = (long long)aib[i] * x % MOD;
      |                      ~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In member function 'int AIB1::query(int)':
horses.cpp:27:39: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |             p = (long long)p * aib[i] % MOD;
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int lgPut(int, int)':
horses.cpp:64:26: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   64 |     p = (long long)p * p % MOD;
      |         ~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:66:30: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   66 |         p = (long long)p * a % MOD;
      |             ~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int answer()':
horses.cpp:99:48: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   99 |     return (long long)horses.query( i ) * y[i] % MOD;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13912 KB Output is correct
2 Correct 2 ms 13948 KB Output is correct
3 Correct 2 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 2 ms 13916 KB Output is correct
6 Correct 2 ms 13912 KB Output is correct
7 Correct 2 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13912 KB Output is correct
10 Correct 2 ms 13916 KB Output is correct
11 Correct 2 ms 13916 KB Output is correct
12 Correct 3 ms 13916 KB Output is correct
13 Correct 3 ms 13916 KB Output is correct
14 Correct 2 ms 13964 KB Output is correct
15 Correct 3 ms 13968 KB Output is correct
16 Correct 2 ms 13916 KB Output is correct
17 Correct 2 ms 13916 KB Output is correct
18 Correct 2 ms 13916 KB Output is correct
19 Correct 3 ms 13912 KB Output is correct
20 Correct 3 ms 13912 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13912 KB Output is correct
2 Correct 2 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 2 ms 13916 KB Output is correct
5 Correct 2 ms 13916 KB Output is correct
6 Correct 2 ms 13916 KB Output is correct
7 Correct 2 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 2 ms 13916 KB Output is correct
10 Correct 3 ms 13916 KB Output is correct
11 Correct 3 ms 13916 KB Output is correct
12 Correct 3 ms 13916 KB Output is correct
13 Correct 2 ms 13912 KB Output is correct
14 Correct 3 ms 13916 KB Output is correct
15 Correct 3 ms 13916 KB Output is correct
16 Correct 2 ms 13756 KB Output is correct
17 Correct 2 ms 13916 KB Output is correct
18 Correct 2 ms 13916 KB Output is correct
19 Correct 2 ms 13916 KB Output is correct
20 Correct 2 ms 13916 KB Output is correct
21 Correct 2 ms 13916 KB Output is correct
22 Correct 2 ms 13916 KB Output is correct
23 Correct 63 ms 13916 KB Output is correct
24 Correct 59 ms 13916 KB Output is correct
25 Correct 55 ms 14172 KB Output is correct
26 Correct 51 ms 13912 KB Output is correct
27 Correct 68 ms 14044 KB Output is correct
28 Correct 117 ms 14044 KB Output is correct
29 Correct 96 ms 14036 KB Output is correct
30 Correct 90 ms 13912 KB Output is correct
31 Correct 5 ms 13916 KB Output is correct
32 Correct 49 ms 14064 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 58124 KB Output is correct
2 Execution timed out 1555 ms 57144 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13912 KB Output is correct
2 Correct 2 ms 13916 KB Output is correct
3 Correct 2 ms 13916 KB Output is correct
4 Correct 2 ms 13916 KB Output is correct
5 Correct 3 ms 13960 KB Output is correct
6 Correct 2 ms 13912 KB Output is correct
7 Correct 2 ms 13916 KB Output is correct
8 Correct 2 ms 13916 KB Output is correct
9 Correct 2 ms 13916 KB Output is correct
10 Correct 2 ms 13916 KB Output is correct
11 Correct 3 ms 13916 KB Output is correct
12 Correct 3 ms 13964 KB Output is correct
13 Correct 2 ms 13912 KB Output is correct
14 Correct 2 ms 13916 KB Output is correct
15 Correct 2 ms 13916 KB Output is correct
16 Correct 2 ms 14168 KB Output is correct
17 Correct 2 ms 13912 KB Output is correct
18 Correct 3 ms 13916 KB Output is correct
19 Correct 2 ms 13916 KB Output is correct
20 Correct 2 ms 13916 KB Output is correct
21 Correct 2 ms 13916 KB Output is correct
22 Correct 3 ms 13916 KB Output is correct
23 Correct 62 ms 14064 KB Output is correct
24 Correct 59 ms 14304 KB Output is correct
25 Correct 49 ms 14116 KB Output is correct
26 Correct 62 ms 13916 KB Output is correct
27 Correct 62 ms 14040 KB Output is correct
28 Correct 105 ms 13916 KB Output is correct
29 Correct 92 ms 13912 KB Output is correct
30 Correct 94 ms 14296 KB Output is correct
31 Correct 5 ms 13912 KB Output is correct
32 Correct 49 ms 14040 KB Output is correct
33 Execution timed out 1570 ms 57032 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13916 KB Output is correct
2 Correct 2 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 2 ms 13916 KB Output is correct
5 Correct 2 ms 13916 KB Output is correct
6 Correct 2 ms 13916 KB Output is correct
7 Correct 2 ms 13916 KB Output is correct
8 Correct 2 ms 13916 KB Output is correct
9 Correct 2 ms 13916 KB Output is correct
10 Correct 3 ms 13916 KB Output is correct
11 Correct 3 ms 13916 KB Output is correct
12 Correct 3 ms 13916 KB Output is correct
13 Correct 2 ms 13916 KB Output is correct
14 Correct 3 ms 13916 KB Output is correct
15 Correct 2 ms 13912 KB Output is correct
16 Correct 3 ms 13912 KB Output is correct
17 Correct 3 ms 13912 KB Output is correct
18 Correct 2 ms 13916 KB Output is correct
19 Correct 2 ms 13916 KB Output is correct
20 Correct 2 ms 13912 KB Output is correct
21 Correct 3 ms 13916 KB Output is correct
22 Correct 3 ms 13916 KB Output is correct
23 Correct 63 ms 14044 KB Output is correct
24 Correct 60 ms 14168 KB Output is correct
25 Correct 49 ms 14048 KB Output is correct
26 Correct 51 ms 13916 KB Output is correct
27 Correct 62 ms 13912 KB Output is correct
28 Correct 105 ms 14044 KB Output is correct
29 Correct 97 ms 14040 KB Output is correct
30 Correct 92 ms 14048 KB Output is correct
31 Correct 7 ms 13916 KB Output is correct
32 Correct 49 ms 14064 KB Output is correct
33 Correct 208 ms 57936 KB Output is correct
34 Execution timed out 1565 ms 57096 KB Time limit exceeded
35 Halted 0 ms 0 KB -