oj.uz

답안 #1001092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001092 2024-06-18T14:26:15 Z Ausp3x 말 (IOI15_horses) C++17
34 / 100
 1500 ms 12116 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;

int getMaxValue() {
    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;
        }
    }

    return -1;
}


int init(int n, int x[], int y[]) {
    N = n;
    X.resize(n);
    Y.resize(n);
    for (int i = 0; i < n; i++) {
        X[i] = x[i];
        Y[i] = y[i];
    }

	return getMaxValue();
}

int updateX(int pos, int val) {	
    X[pos] = val;

	return getMaxValue();
}

int updateY(int pos, int val) {
    Y[pos] = val;

	return getMaxValue();
}

// int main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);

//     cout << init(3, {2, 1, 3}, {3, 4, 1}) << endl;
//     cout << updateY(1, 2) << endl;

//     return 0;
// }

Compilation message

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 512 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 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 360 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 0 ms 348 KB Output is correct
19 Correct 0 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 464 KB Output is correct
24 Correct 6 ms 468 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 5 ms 348 KB Output is correct
27 Correct 11 ms 476 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 160 ms 440 KB Output is correct
30 Correct 64 ms 344 KB Output is correct
31 Correct 111 ms 344 KB Output is correct
32 Correct 299 ms 348 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1535 ms 10332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 424 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 5 ms 448 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 11 ms 348 KB Output is correct
28 Correct 5 ms 464 KB Output is correct
29 Correct 164 ms 348 KB Output is correct
30 Correct 59 ms 348 KB Output is correct
31 Correct 109 ms 348 KB Output is correct
32 Correct 272 ms 344 KB Output is correct
33 Execution timed out 1552 ms 12116 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 5 ms 348 KB Output is correct
27 Correct 11 ms 348 KB Output is correct
28 Correct 5 ms 348 KB Output is correct
29 Correct 158 ms 348 KB Output is correct
30 Correct 59 ms 344 KB Output is correct
31 Correct 114 ms 348 KB Output is correct
32 Correct 310 ms 448 KB Output is correct
33 Execution timed out 1510 ms 10444 KB Time limit exceeded
34 Halted 0 ms 0 KB -