| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 571833 |
2022-06-02T20:08:59 Z |
beaconmc |
Horses (IOI15_horses) |
C++14 |
|
1500 ms |
36144 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
// #include "horses.h"
using namespace std;
vector<ll> x, y, xx, yy;
ll n;
int init(int N, int X[], int Y[]) {
n = N;
FOR(i,0,N){
xx.push_back(X[i]);
yy.push_back(Y[i]);
}
x.push_back(X[0]);
y.push_back(Y[0]);
FOR(i,1,N){
x.push_back(x[i-1] * X[i]%1000000007);
y.push_back(Y[i]);
}
ll maxi = -1;
FOR(i,0,N){
maxi = max(maxi, x[i] * y[i]%1000000007);
}
return (int) maxi;
}
int updateX(int pos, int val) {
ll prev = xx[pos];
xx[pos] = val;
FOR(i,pos,n){
cout << prev << " " << val << endl;
x[i] /= prev;
x[i] *= val;
x[i] %= 1000000007;
}
ll maxi = -1;
FOR(i,0, n){
maxi = max(maxi, x[i] * y[i]%1000000007);
}
return (int)maxi;
}
int updateY(int pos, int val) {
y[pos] = val;
ll maxi = -1;
FOR(i,0, n){
cout << x[i] << " " << y[i] << endl;
maxi = max(maxi, x[i] * y[i]%1000000007);
}
return (int)maxi;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
224 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
220 KB |
Output is correct |
| 7 |
Correct |
0 ms |
220 KB |
Output is correct |
| 8 |
Correct |
0 ms |
220 KB |
Output is correct |
| 9 |
Correct |
1 ms |
220 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
256 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1542 ms |
36144 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
300 KB |
Output is correct |
| 2 |
Correct |
0 ms |
300 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
224 KB |
Output is correct |
| 12 |
Correct |
1 ms |
224 KB |
Output is correct |
| 13 |
Correct |
0 ms |
224 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
224 KB |
Output is correct |
| 16 |
Correct |
1 ms |
224 KB |
Output is correct |
| 17 |
Correct |
0 ms |
224 KB |
Output is correct |
| 18 |
Correct |
0 ms |
224 KB |
Output is correct |
| 19 |
Correct |
0 ms |
224 KB |
Output is correct |
| 20 |
Correct |
0 ms |
224 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
224 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
224 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
224 KB |
Output is correct |
| 7 |
Correct |
0 ms |
224 KB |
Output is correct |
| 8 |
Correct |
0 ms |
216 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
