Submission #1191984

#TimeUsernameProblemLanguageResultExecution timeMemory
1191984nagorn_phHorses (IOI15_horses)C++20
0 / 100
15 ms4424 KiB
#include <bits/stdc++.h> #include "horses.h" using namespace std; const int mod = 1e9 + 7; int init(int n, int x[], int y[]) { int ans = 1; for (int i = 0; i < n; i++) ans *= x[i]; ans *= y[n - 1]; ans %= mod; return ans; } int updateX(int pos, int val) { return 0; } int updateY(int pos, int val) { return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...