# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
58486 | 2018-07-18T03:03:19 Z | E869120 | 말 (IOI15_horses) | C++14 | 24 ms | 12684 KB |
#include "horses.h" #include <iostream> using namespace std; long long N, X[100009], Y[100009], Allval = 0, mod = 1000000007; long long modpow(int a, int b, int m) { long long p = 1, q = a; for (int i = 0; i < 31; i++) { if ((b&(1 << i)) != 0) { p *= q; p %= m; } q *= q; q %= m; } return p; } long long Div(int a, int b, int m) { return (1LL * a*modpow(b, m - 2, m)) % m; } int solve() { pair<int, int>maxid = make_pair(0, 1); long long P = 1; for (int i = N - 1; i >= 0; i--) { // Y[i] / P と比べる if (maxid.first*P < maxid.second * Y[i]) maxid = make_pair(Y[i], P); P *= X[i]; if (P >= (1LL << 30)) break; } long long J = Div(Allval, maxid.second, mod); J *= maxid.first; J %= mod; return J; } int init(int NN, int XX[], int YY[]) { N = NN; Allval = 1; for (int i = 0; i < N; i++) { X[i] = XX[i]; Allval *= X[i]; } for (int i = 0; i < N; i++) Y[i] = YY[i]; return solve(); } int updateX(int pos, int val) { Allval = Div(Allval, X[pos], mod); X[pos] = val; Allval *= X[pos]; Allval %= mod; return solve(); } int updateY(int pos, int val) { Y[pos] = val; return solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 3 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
4 | Correct | 3 ms | 572 KB | Output is correct |
5 | Correct | 4 ms | 576 KB | Output is correct |
6 | Correct | 3 ms | 580 KB | Output is correct |
7 | Correct | 3 ms | 580 KB | Output is correct |
8 | Correct | 2 ms | 580 KB | Output is correct |
9 | Correct | 2 ms | 828 KB | Output is correct |
10 | Correct | 2 ms | 828 KB | Output is correct |
11 | Correct | 2 ms | 828 KB | Output is correct |
12 | Correct | 2 ms | 828 KB | Output is correct |
13 | Correct | 2 ms | 828 KB | Output is correct |
14 | Correct | 2 ms | 828 KB | Output is correct |
15 | Correct | 2 ms | 828 KB | Output is correct |
16 | Correct | 2 ms | 828 KB | Output is correct |
17 | Correct | 4 ms | 828 KB | Output is correct |
18 | Correct | 2 ms | 828 KB | Output is correct |
19 | Correct | 2 ms | 948 KB | Output is correct |
20 | Correct | 4 ms | 948 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 948 KB | Output is correct |
2 | Correct | 2 ms | 1004 KB | Output is correct |
3 | Correct | 3 ms | 1004 KB | Output is correct |
4 | Correct | 3 ms | 1004 KB | Output is correct |
5 | Correct | 2 ms | 1004 KB | Output is correct |
6 | Correct | 2 ms | 1004 KB | Output is correct |
7 | Correct | 2 ms | 1004 KB | Output is correct |
8 | Correct | 3 ms | 1004 KB | Output is correct |
9 | Correct | 3 ms | 1004 KB | Output is correct |
10 | Correct | 3 ms | 1004 KB | Output is correct |
11 | Correct | 3 ms | 1004 KB | Output is correct |
12 | Correct | 2 ms | 1004 KB | Output is correct |
13 | Correct | 3 ms | 1004 KB | Output is correct |
14 | Correct | 3 ms | 1004 KB | Output is correct |
15 | Correct | 3 ms | 1004 KB | Output is correct |
16 | Correct | 3 ms | 1008 KB | Output is correct |
17 | Correct | 3 ms | 1012 KB | Output is correct |
18 | Correct | 3 ms | 1016 KB | Output is correct |
19 | Correct | 3 ms | 1020 KB | Output is correct |
20 | Correct | 3 ms | 1024 KB | Output is correct |
21 | Correct | 2 ms | 1024 KB | Output is correct |
22 | Incorrect | 2 ms | 1024 KB | Output isn't correct |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 24 ms | 12684 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 12684 KB | Output is correct |
2 | Correct | 3 ms | 12684 KB | Output is correct |
3 | Correct | 2 ms | 12684 KB | Output is correct |
4 | Correct | 2 ms | 12684 KB | Output is correct |
5 | Correct | 3 ms | 12684 KB | Output is correct |
6 | Correct | 2 ms | 12684 KB | Output is correct |
7 | Correct | 3 ms | 12684 KB | Output is correct |
8 | Correct | 2 ms | 12684 KB | Output is correct |
9 | Correct | 4 ms | 12684 KB | Output is correct |
10 | Correct | 3 ms | 12684 KB | Output is correct |
11 | Correct | 3 ms | 12684 KB | Output is correct |
12 | Correct | 2 ms | 12684 KB | Output is correct |
13 | Correct | 2 ms | 12684 KB | Output is correct |
14 | Correct | 3 ms | 12684 KB | Output is correct |
15 | Correct | 3 ms | 12684 KB | Output is correct |
16 | Correct | 3 ms | 12684 KB | Output is correct |
17 | Correct | 3 ms | 12684 KB | Output is correct |
18 | Correct | 3 ms | 12684 KB | Output is correct |
19 | Correct | 3 ms | 12684 KB | Output is correct |
20 | Correct | 3 ms | 12684 KB | Output is correct |
21 | Correct | 3 ms | 12684 KB | Output is correct |
22 | Incorrect | 3 ms | 12684 KB | Output isn't correct |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 12684 KB | Output is correct |
2 | Correct | 4 ms | 12684 KB | Output is correct |
3 | Correct | 2 ms | 12684 KB | Output is correct |
4 | Correct | 3 ms | 12684 KB | Output is correct |
5 | Correct | 2 ms | 12684 KB | Output is correct |
6 | Correct | 2 ms | 12684 KB | Output is correct |
7 | Correct | 2 ms | 12684 KB | Output is correct |
8 | Correct | 2 ms | 12684 KB | Output is correct |
9 | Correct | 2 ms | 12684 KB | Output is correct |
10 | Correct | 3 ms | 12684 KB | Output is correct |
11 | Correct | 3 ms | 12684 KB | Output is correct |
12 | Correct | 3 ms | 12684 KB | Output is correct |
13 | Correct | 2 ms | 12684 KB | Output is correct |
14 | Correct | 3 ms | 12684 KB | Output is correct |
15 | Correct | 3 ms | 12684 KB | Output is correct |
16 | Correct | 2 ms | 12684 KB | Output is correct |
17 | Correct | 2 ms | 12684 KB | Output is correct |
18 | Correct | 2 ms | 12684 KB | Output is correct |
19 | Correct | 3 ms | 12684 KB | Output is correct |
20 | Correct | 2 ms | 12684 KB | Output is correct |
21 | Correct | 2 ms | 12684 KB | Output is correct |
22 | Incorrect | 2 ms | 12684 KB | Output isn't correct |
23 | Halted | 0 ms | 0 KB | - |