답안 #927804

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927804	2024-02-15T10:53:54 Z	VMaksimoski008	말 (IOI15_horses)	C++14	17 / 100	1500 ms	9052 KB

horses

#include <bits/stdc++.h>
#include "horses.h"

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;

int n;
vector<ll> X(5*maxn), Y(maxn);

int calc() {
    ll curr = 1, ans = 0;
    for(int i=0; i<n; i++) {
        curr = (curr * X[i]) % mod;
        ans = max(ans, (curr * Y[i]) % mod);
    }
    return (int)ans;
}

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

int updateX(int p, int v) {
    X[p] = v;
    return calc();
}

int updateY(int p, int v) {
    Y[p] = v;
    return calc();
}

Subtask #1

17.0 / 17.0

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

Subtask #2

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4956 KB	Output is correct
2	Correct	1 ms	4956 KB	Output is correct
3	Correct	1 ms	4956 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	2 ms	4956 KB	Output is correct
6	Correct	2 ms	4956 KB	Output is correct
7	Correct	2 ms	4956 KB	Output is correct
8	Correct	2 ms	4956 KB	Output is correct
9	Correct	2 ms	4956 KB	Output is correct
10	Correct	2 ms	4956 KB	Output is correct
11	Correct	1 ms	4956 KB	Output is correct
12	Correct	2 ms	4956 KB	Output is correct
13	Correct	2 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	1 ms	4956 KB	Output is correct
16	Correct	2 ms	4956 KB	Output is correct
17	Correct	1 ms	5112 KB	Output is correct
18	Correct	2 ms	4956 KB	Output is correct
19	Correct	2 ms	4956 KB	Output is correct
20	Correct	2 ms	4956 KB	Output is correct
21	Incorrect	2 ms	4956 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

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

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	4956 KB	Output is correct
2	Correct	2 ms	4956 KB	Output is correct
3	Correct	2 ms	4956 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	1 ms	4956 KB	Output is correct
6	Correct	2 ms	5200 KB	Output is correct
7	Correct	1 ms	4956 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	2 ms	4956 KB	Output is correct
10	Correct	2 ms	4956 KB	Output is correct
11	Correct	2 ms	4952 KB	Output is correct
12	Correct	2 ms	4956 KB	Output is correct
13	Correct	2 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	1 ms	4956 KB	Output is correct
16	Correct	2 ms	4956 KB	Output is correct
17	Correct	1 ms	4956 KB	Output is correct
18	Correct	2 ms	4952 KB	Output is correct
19	Correct	2 ms	4956 KB	Output is correct
20	Correct	2 ms	4956 KB	Output is correct
21	Incorrect	2 ms	4956 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	4956 KB	Output is correct
2	Correct	2 ms	4900 KB	Output is correct
3	Correct	1 ms	4956 KB	Output is correct
4	Correct	2 ms	4956 KB	Output is correct
5	Correct	2 ms	5208 KB	Output is correct
6	Correct	2 ms	4956 KB	Output is correct
7	Correct	2 ms	4956 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	1 ms	4956 KB	Output is correct
10	Correct	1 ms	4956 KB	Output is correct
11	Correct	1 ms	4956 KB	Output is correct
12	Correct	1 ms	4956 KB	Output is correct
13	Correct	1 ms	4952 KB	Output is correct
14	Correct	1 ms	4952 KB	Output is correct
15	Correct	2 ms	4956 KB	Output is correct
16	Correct	1 ms	4956 KB	Output is correct
17	Correct	1 ms	5000 KB	Output is correct
18	Correct	2 ms	4952 KB	Output is correct
19	Correct	1 ms	4956 KB	Output is correct
20	Correct	1 ms	4956 KB	Output is correct
21	Incorrect	1 ms	4956 KB	Output isn't correct
22	Halted	0 ms	0 KB	-