이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "horses.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n;
pii niz[maxn];
const int mod = 1e9 + 7;
ll mul(ll a, ll b){
return (a * b) % mod;
}
ll get(){
ll ans = 0;
ll p = 1;
ff(i,1,n)p = mul(p, niz[i].fi), ans = max(ans, mul(p, niz[i].se));
return ans;
}
int init(int N, int X[], int Y[]) {
n = N;
ff(i,1,n)niz[i] = {X[i - 1], Y[i - 1]};
return get();
}
int updateX(int pos, int val) {
pos++, niz[pos].fi = val;
return get();
}
int updateY(int pos, int val) {
pos++, niz[pos].se = val;
return get();
}
//int main()
//{
// ios::sync_with_stdio(false);
// cout.tie(nullptr);
// cin.tie(nullptr);
//
// return 0;
//}
/**
// probati bojenje sahovski ili slicno
**/
컴파일 시 표준 에러 (stderr) 메시지
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:48:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
48 | return get();
| ~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:53:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
53 | return get();
| ~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:58:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
58 | return get();
| ~~~^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |