oj.uz

Submission #1001896

# Submission time Handle Problem Language Result Execution time Memory
1001896 2024-06-19T08:23:59 Z Ausp3x Horses (IOI15_horses) C++17
54 / 100
 1500 ms 21672 KB 
// 人外有人，天外有天
// author: Ausp3x
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "horses.h"
typedef long long             lng;
typedef unsigned int          uint;
typedef unsigned long long    ulng;
using namespace std;
using namespace __gnu_pbds;
 
int const INF32 = 0x3f3f3f3f;
lng const INF64 = 0x3f3f3f3f3f3f3f3f;
 
int const MOD = 1000000007;
 
int N;
vector<int> X, Y;
 
lng modPow(lng x, lng y) {
    lng res = 1;
 
    while (y > 0) {
        if (y & 1) {
            res *= x;
            res %= MOD;
        }
 
        y >>= 1;
        x *= x;
        x %= MOD;
    }
 
    return (res + MOD) % MOD;
}
 
lng almostAllHorses = 1;
int getMaxValue(int opt) {
    if (opt == 1) {
        lng horses = 1;
        for (int i = 0; i < N; i++) {
            (horses *= X[i]) %= MOD;
            
            bool chk = true;
            lng cur = 1; 
            for (int j = i + 1; j < N; j++) {
                if (cur == INF32 || cur * X[j] > INF32) {
                    chk = false;
                    break;
                }
                cur *= X[j];
 
                if (cur * Y[j] > Y[i]) {
                    chk = false;
                    break;
                }
            }
                
            if (chk) {
                return horses * Y[i] % MOD;
            }
        }
    } else if (opt == 2) {
        lng horses = almostAllHorses;
        for (int i = max(N - 64, 0); i < N; i++) {
            (horses *= X[i]) %= MOD;
            
            bool chk = true;
            lng cur = 1; 
            for (int j = i + 1; j < N; j++) {
                if (cur == INF32 || cur * X[j] > INF32) {
                    chk = false;
                    break;
                }
                cur *= X[j];
 
                if (cur * Y[j] > Y[i]) {
                    chk = false;
                    break;
                }
            }
                
            if (chk) {
                return horses * Y[i] % MOD;
            }
        }
    }
 
    return -1;
}
 
bool allXG1 = true;
int init(int n, int x[], int y[]) {
    N = n;
    X.resize(n);
    Y.resize(n);
    for (int i = 0; i < N; i++) {
        if (i < N - 64)
            (almostAllHorses *= x[i]) %= MOD;
        
        if (x[i] < 2)
            allXG1 = false;

        X[i] = x[i];
        Y[i] = y[i];
    }
 
	return (allXG1 ? getMaxValue(2) : getMaxValue(1));
}
 
bool allValG1 = true;
int updateX(int pos, int val) {
    if (pos < N - 64) {
        (almostAllHorses *= modPow(X[pos], MOD - 2)) %= MOD;
        (almostAllHorses *= val) %= MOD;
    }

    if (val < 2)
        allValG1 = false;
    
    X[pos] = val;

	return (allXG1 && allValG1 ? getMaxValue(2) : getMaxValue(1));
}
 
int updateY(int pos, int val) {    
    Y[pos] = val;
 
	return (allXG1 && allValG1 ? getMaxValue(2) : getMaxValue(1));
}
 
// int main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);
 
//     int x[3] = {2, 1, 3};
//     int y[3] = {3, 4, 1};
//     cout << init(3, x, y) << endl;
//     cout << updateY(1, 2) << endl;
 
//     return 0;
// }

Compilation message

horses.cpp: In function 'int getMaxValue(int)':
horses.cpp:61:38: warning: conversion from 'lng' {aka 'long long int'} to 'int' may change value [-Wconversion]
   61 |                 return horses * Y[i] % MOD;
      |                        ~~~~~~~~~~~~~~^~~~~
horses.cpp:85:38: warning: conversion from 'lng' {aka 'long long int'} to 'int' may change value [-Wconversion]
   85 |                 return horses * Y[i] % MOD;
      |                        ~~~~~~~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 428 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 6 ms 700 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 13 ms 472 KB Output is correct
28 Correct 5 ms 348 KB Output is correct
29 Correct 169 ms 348 KB Output is correct
30 Correct 66 ms 472 KB Output is correct
31 Correct 107 ms 348 KB Output is correct
32 Correct 295 ms 448 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12992 KB Output is correct
2 Correct 99 ms 21616 KB Output is correct
3 Correct 77 ms 12864 KB Output is correct
4 Correct 87 ms 16772 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 372 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 368 KB Output is correct
13 Correct 0 ms 372 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 0 ms 360 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 0 ms 360 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 6 ms 484 KB Output is correct
24 Correct 8 ms 592 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 16 ms 472 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 152 ms 360 KB Output is correct
30 Correct 60 ms 356 KB Output is correct
31 Correct 108 ms 360 KB Output is correct
32 Correct 285 ms 460 KB Output is correct
33 Execution timed out 1523 ms 12128 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 0 ms 448 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 0 ms 360 KB Output is correct
22 Correct 0 ms 360 KB Output is correct
23 Correct 9 ms 480 KB Output is correct
24 Correct 6 ms 360 KB Output is correct
25 Correct 5 ms 500 KB Output is correct
26 Correct 5 ms 484 KB Output is correct
27 Correct 13 ms 356 KB Output is correct
28 Correct 6 ms 360 KB Output is correct
29 Correct 166 ms 448 KB Output is correct
30 Correct 61 ms 360 KB Output is correct
31 Correct 114 ms 456 KB Output is correct
32 Correct 289 ms 464 KB Output is correct
33 Correct 48 ms 12948 KB Output is correct
34 Correct 106 ms 21672 KB Output is correct
35 Correct 67 ms 12816 KB Output is correct
36 Correct 84 ms 16840 KB Output is correct
37 Execution timed out 1556 ms 12092 KB Time limit exceeded
38 Halted 0 ms 0 KB -