| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1004797 | 2024-06-21T15:50:37 Z | magikarp23 | 말 (IOI15_horses) | C++17 | 1500 ms | 8028 KB |
#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
const int MAX_N = 500000 + 1;
long long MOD = 1000000000 + 7;
int X_store[MAX_N];
int Y_store[MAX_N];
int N_store;
int init(int N, int X[], int Y[]) {
N_store = N;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N; i++) {
X_store[i] = X[i];
Y_store[i] = Y[i];
num_horses *= X[i];
max_profit = max(max_profit, num_horses * Y[i]);
}
return max_profit % MOD;
}
int updateX(int pos, int val) {
X_store[pos] = val;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N_store; i++) {
num_horses *= X_store[i];
max_profit = max(max_profit, num_horses * Y_store[i]);
}
return max_profit % MOD;
}
int updateY(int pos, int val) {
Y_store[pos] = val;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N_store; i++) {
num_horses *= X_store[i];
max_profit = max(max_profit, num_horses * Y_store[i]);
}
return max_profit % MOD;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2396 KB | Output is correct |
| 2 | Correct | 0 ms | 2396 KB | Output is correct |
| 3 | Correct | 0 ms | 2396 KB | Output is correct |
| 4 | Correct | 0 ms | 2396 KB | Output is correct |
| 5 | Correct | 0 ms | 2396 KB | Output is correct |
| 6 | Correct | 0 ms | 2396 KB | Output is correct |
| 7 | Correct | 0 ms | 2396 KB | Output is correct |
| 8 | Correct | 0 ms | 2396 KB | Output is correct |
| 9 | Correct | 1 ms | 2396 KB | Output is correct |
| 10 | Correct | 0 ms | 2396 KB | Output is correct |
| 11 | Correct | 0 ms | 2396 KB | Output is correct |
| 12 | Correct | 0 ms | 2396 KB | Output is correct |
| 13 | Correct | 0 ms | 2396 KB | Output is correct |
| 14 | Correct | 0 ms | 2396 KB | Output is correct |
| 15 | Correct | 0 ms | 2396 KB | Output is correct |
| 16 | Correct | 0 ms | 2396 KB | Output is correct |
| 17 | Correct | 0 ms | 2396 KB | Output is correct |
| 18 | Correct | 1 ms | 2396 KB | Output is correct |
| 19 | Correct | 0 ms | 2396 KB | Output is correct |
| 20 | Correct | 0 ms | 2396 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 2396 KB | Output is correct |
| 2 | Correct | 0 ms | 2396 KB | Output is correct |
| 3 | Correct | 1 ms | 2396 KB | Output is correct |
| 4 | Correct | 0 ms | 2396 KB | Output is correct |
| 5 | Correct | 0 ms | 2396 KB | Output is correct |
| 6 | Correct | 0 ms | 2396 KB | Output is correct |
| 7 | Correct | 0 ms | 2396 KB | Output is correct |
| 8 | Correct | 1 ms | 2396 KB | Output is correct |
| 9 | Correct | 0 ms | 2396 KB | Output is correct |
| 10 | Correct | 0 ms | 2396 KB | Output is correct |
| 11 | Correct | 0 ms | 2396 KB | Output is correct |
| 12 | Correct | 0 ms | 2396 KB | Output is correct |
| 13 | Correct | 0 ms | 2396 KB | Output is correct |
| 14 | Correct | 1 ms | 2396 KB | Output is correct |
| 15 | Correct | 0 ms | 2396 KB | Output is correct |
| 16 | Correct | 0 ms | 2396 KB | Output is correct |
| 17 | Correct | 0 ms | 2396 KB | Output is correct |
| 18 | Correct | 0 ms | 2392 KB | Output is correct |
| 19 | Correct | 0 ms | 2396 KB | Output is correct |
| 20 | Correct | 0 ms | 2396 KB | Output is correct |
| 21 | Incorrect | 0 ms | 2396 KB | Output isn't correct |
| 22 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 1556 ms | 8028 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2392 KB | Output is correct |
| 2 | Correct | 1 ms | 2392 KB | Output is correct |
| 3 | Correct | 0 ms | 2396 KB | Output is correct |
| 4 | Correct | 0 ms | 2396 KB | Output is correct |
| 5 | Correct | 0 ms | 2396 KB | Output is correct |
| 6 | Correct | 0 ms | 2396 KB | Output is correct |
| 7 | Correct | 0 ms | 2396 KB | Output is correct |
| 8 | Correct | 0 ms | 2396 KB | Output is correct |
| 9 | Correct | 0 ms | 2396 KB | Output is correct |
| 10 | Correct | 1 ms | 2396 KB | Output is correct |
| 11 | Correct | 0 ms | 2396 KB | Output is correct |
| 12 | Correct | 0 ms | 2396 KB | Output is correct |
| 13 | Correct | 0 ms | 2396 KB | Output is correct |
| 14 | Correct | 0 ms | 2396 KB | Output is correct |
| 15 | Correct | 0 ms | 2396 KB | Output is correct |
| 16 | Correct | 1 ms | 2396 KB | Output is correct |
| 17 | Correct | 0 ms | 2396 KB | Output is correct |
| 18 | Correct | 0 ms | 2396 KB | Output is correct |
| 19 | Correct | 1 ms | 2396 KB | Output is correct |
| 20 | Correct | 0 ms | 2396 KB | Output is correct |
| 21 | Incorrect | 0 ms | 2396 KB | Output isn't correct |
| 22 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2396 KB | Output is correct |
| 2 | Correct | 0 ms | 2396 KB | Output is correct |
| 3 | Correct | 0 ms | 2396 KB | Output is correct |
| 4 | Correct | 1 ms | 2396 KB | Output is correct |
| 5 | Correct | 1 ms | 2396 KB | Output is correct |
| 6 | Correct | 0 ms | 2396 KB | Output is correct |
| 7 | Correct | 0 ms | 2396 KB | Output is correct |
| 8 | Correct | 1 ms | 2396 KB | Output is correct |
| 9 | Correct | 0 ms | 2396 KB | Output is correct |
| 10 | Correct | 0 ms | 2396 KB | Output is correct |
| 11 | Correct | 0 ms | 2396 KB | Output is correct |
| 12 | Correct | 0 ms | 2396 KB | Output is correct |
| 13 | Correct | 0 ms | 2396 KB | Output is correct |
| 14 | Correct | 1 ms | 2396 KB | Output is correct |
| 15 | Correct | 0 ms | 2396 KB | Output is correct |
| 16 | Correct | 0 ms | 2396 KB | Output is correct |
| 17 | Correct | 0 ms | 2396 KB | Output is correct |
| 18 | Correct | 1 ms | 2652 KB | Output is correct |
| 19 | Correct | 1 ms | 2392 KB | Output is correct |
| 20 | Correct | 1 ms | 2396 KB | Output is correct |
| 21 | Incorrect | 0 ms | 2396 KB | Output isn't correct |
| 22 | Halted | 0 ms | 0 KB | - |