# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053786 | 2024-08-11T17:35:13 Z | Osplei | Horses (IOI15_horses) | C++17 | 592 ms | 524288 KB |
#include "horses.h" #include <bits/stdc++.h> using namespace std; typedef int ll; typedef pair <ll, ll> LL; #define F first #define S second ll mod = 1e9 + 7; int init(int N, int X[], int Y[]) { //pos ans tengo queue <pair <ll, LL>> q; ll ans = 0; q.push({-1, {0, 1}}); while (!q.empty()) { pair <ll, LL> act; act = q.front(); ans = max(ans, act.S.F); q.pop(); if (act.F + 1 >= N) continue; q.push({act.F + 1, {act.S.F % mod, (act.S.S * X[act.F + 1]) % mod}}); q.push({act.F + 1, {((act.S.F % mod) + (((((act.S.S * X[act.F + 1]) % mod) - 1) * Y[act.F + 1]) % mod)) % mod, 1}}); q.push({act.F + 1, {((act.S.F % mod) + ((((act.S.S * X[act.F + 1]) % mod) * Y[act.F + 1]) % mod)) % mod, 0}}); } return ans % mod; } int updateX(int pos, int val) { return 0; } int updateY(int pos, int val) { return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 1 ms | 1116 KB | Output is correct |
4 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 1 ms | 1116 KB | Output is correct |
4 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 592 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 2 ms | 1116 KB | Output is correct |
4 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 1 ms | 1116 KB | Output is correct |
4 | Incorrect | 1 ms | 948 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |