| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1004521 | vjudge1 | 말 (IOI15_horses) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define pf push_front
#define pi pair<int,int>
#define vi vector<int>
int n ;
vi x, y;
const int mod = 1e9+7;
ll init(int N, int X[], int Y[]){
n = N;
x.resize(N);
y.resize(N);
for(int i =0; i < n; i++){
x[i] = X[i];
y[i] = Y[i];
}
ll final = 0;
ll have = 1;
ll cnt = 0, left = 0, prev =1;
ll ccnt = 0, cleft= 0, cl=0;
for(int i = 1; i <= n; i++){
cl = 0;
have = ((have* x[i-1]));
//cout << have << " " << ccnt <<" " << cl <<endl;
while(have>=mod){
ccnt++;
have %=mod;
}
while(y[i-1]>=mod){
cl++;
y[i-1]%=mod;
}
ll hold = have*y[i-1];
while(hold >=mod){
hold%=mod;
ccnt++;
}
if(ccnt*cl> cnt){
cnt = ccnt*cl;
left = hold;
}
else if((ccnt*cl)==cnt && hold> left){
cnt = ccnt*cl;
left = hold;
}
}
return left;
}
ll updateX(int pos, int val){
x[pos]=val;
ll final = 0;
ll have = 1;
ll cnt = 0, left = 0, prev =1;
ll ccnt = 0, cleft= 0, cl=0;
for(int i = 1; i <= n; i++){
cl = 0;
have = ((have* x[i-1]));
while(have>=mod){
ccnt++;
have %=mod;
}
while(y[i-1]>=mod){
cl++;
y[i-1]%=mod;
}
ll hold = have*y[i-1];
while(hold >=mod){
hold%=mod;
ccnt++;
}
if(ccnt*cl> cnt){
cnt = ccnt*cl;
left = hold;
}
else if(ccnt*cl==cnt && hold> left){
cnt = ccnt*cl;
left = hold;
}
}
return left;
}
ll updateY(int pos, int val){
y[pos]=val;
ll final = 0;
ll have = 1;
ll cnt = 0, left = 0, prev =1;
ll ccnt = 0, cleft= 0, cl=0;
for(int i = 1; i <= n; i++){
cl = 0;
have = ((have* x[i-1]));
//cotu << have << endl;
while(have>=mod){
ccnt++;
have %=mod;
}
while(y[i-1]>=mod){
cl++;
y[i-1]%=mod;
}
ll hold = have*y[i-1];
while(hold >=mod){
hold%=mod;
ccnt++;
}
if(ccnt*cl> cnt){
cnt = ccnt*cl;
left = hold;
}
else if(ccnt*cl==cnt && hold> left){
cnt = ccnt*cl;
left = hold;
}
}
return left;
}
int main(){
int n;
cin >> n;
int a[n], b[n];
for(int& i : a){
cin >> i;
}
for(int &i : b){
cin >> i;
}
cout << init(n,a,b)<<endl;
}