이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int n;
const ll mod=1e9+7;
pll ms[1<<21]; //-1,mod
ll x[500001],y[500001];
void build_ms(int l, int r, int idx) {
if (l==r) ms[idx]={x[l],x[l]};
else {
int mid=(l+r)/2;
build_ms(l,mid,2*idx);
build_ms(mid+1,r,2*idx+1);
if (ms[2*idx].first==-1 || ms[2*idx+1].first==-1) ms[idx].first=-1;
else {
if (ms[2*idx].first*ms[2*idx+1].first>1e9) ms[idx].first=-1;
else ms[idx].first=ms[2*idx].first*ms[2*idx+1].first;
}
ms[idx].second=(ms[2*idx].second*ms[2*idx+1].second)%mod;
}
}
void update_ms(int l, int r, int idx, int k, ll val) {
if (l>k || k>r) return;
if (l==r) ms[idx]={val,val};
else {
int mid=(l+r)/2;
update_ms(l,mid,2*idx,k,val);
update_ms(mid+1,r,2*idx+1,k,val);
if (ms[2*idx].first==-1 || ms[2*idx+1].first==-1) ms[idx].first=-1;
else {
if (ms[2*idx].first*ms[2*idx+1].first>1e9) ms[idx].first=-1;
else ms[idx].first=ms[2*idx].first*ms[2*idx+1].first;
}
ms[idx].second=(ms[2*idx].second*ms[2*idx+1].second)%mod;
}
}
ll query_ms(int l, int r, int idx, int x, int y) {
if (l>y || r<x) return 1;
if (x<=l && r<=y) return ms[idx].first;
int mid=(l+r)/2;
ll ml=query_ms(l,mid,2*idx,x,y), mr=query_ms(mid+1,r,2*idx+1,x,y);
if (ml==-1 || mr==-1) return -1;
else {
if (ml*mr>1e9) return -1;
else return ml*mr;
}
}
ll query_ms2(int l, int r, int idx, int x, int y) {
if (l>y || r<x) return 1;
if (x<=l && r<=y) return ms[idx].second;
int mid=(l+r)/2;
return (query_ms2(l,mid,2*idx,x,y)*query_ms2(mid+1,r,2*idx+1,x,y))%mod;
}
ll h;
int check(int a, int b) { //whether who is bigger between s[a] and a[b]
h=query_ms(0,n-1,1,a+1,b);
if (h==-1) return b;
if (y[a]>y[b]*h) return a;
else return b;
}
ll s[1<<21];
void update(int l, int r, int idx) {
if (l==r) s[idx]=l;
else {
int mid=(l+r)/2;
update(l,mid,2*idx);
update(mid+1,r,2*idx+1);
s[idx]=check(s[2*idx],s[2*idx+1]);
}
}
void update2(int l, int r, int idx, int x, int y) {
if (l>y || r<x) return;
if (x<=l && y<=r) return;
else {
int mid=(l+r)/2;
update2(l,mid,2*idx,x,y);
update2(mid+1,r,2*idx+1,x,y);
s[idx]=check(s[2*idx],s[2*idx+1]);
}
}
void update3(int l, int r, int idx, int x) {
if (l>x || x>r) return;
if (l==r) return;
else {
int mid=(l+r)/2;
update3(l,mid,2*idx,x);
update3(mid+1,r,2*idx+1,x);
s[idx]=check(s[2*idx],s[2*idx+1]);
}
}
int init(int N, int X[], int Y[]) {
n=N;
if (n<=10) {
for (int i=0; i<n; ++i) x[i]=X[i], y[i]=Y[i];
build_ms(0,n-1,1);
update(0,n-1,1);
}
return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
}
int updateX(int pos, int val) {
if (n<=10) {
x[pos]=val;
update_ms(0,n-1,1,pos,val);
update2(0,n-1,1,pos,n-1);
}
return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
}
int updateY(int pos, int val) {
if (n<=10) {
y[pos]=val;
update3(0,n-1,1,pos);
}
return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
}
int main() {
int k[]={100000,200000,300000,400000,500000}, m[]={1,2,3,4,5};
init(5,k,m);
cout<<s[1]<<" "<<updateY(4,1)<<"\n";
cout<<s[1]<<" "<<updateX(4,2)<<"\n";
cout<<s[1]<<" "<<updateX(0,1)<<"\n";
}
컴파일 시 표준 에러 (stderr) 메시지
horses.cpp: In function 'void build_ms(int, int, int)':
horses.cpp:21:32: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
21 | if (ms[2*idx].first*ms[2*idx+1].first>1e9) ms[idx].first=-1;
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
horses.cpp: In function 'void update_ms(int, int, int, int, ll)':
horses.cpp:38:32: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
38 | if (ms[2*idx].first*ms[2*idx+1].first>1e9) ms[idx].first=-1;
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
horses.cpp: In function 'll query_ms(int, int, int, int, int)':
horses.cpp:45:47: warning: declaration of 'y' shadows a global declaration [-Wshadow]
45 | ll query_ms(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:14: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:45:40: warning: declaration of 'x' shadows a global declaration [-Wshadow]
45 | ll query_ms(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:4: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:54:15: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
54 | if (ml*mr>1e9) return -1;
| ~~^~~
horses.cpp: In function 'll query_ms2(int, int, int, int, int)':
horses.cpp:59:48: warning: declaration of 'y' shadows a global declaration [-Wshadow]
59 | ll query_ms2(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:14: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:59:41: warning: declaration of 'x' shadows a global declaration [-Wshadow]
59 | ll query_ms2(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:4: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp: In function 'void update(int, int, int)':
horses.cpp:83:29: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
83 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~^
horses.cpp:83:40: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
83 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~~~^
horses.cpp: In function 'void update2(int, int, int, int, int)':
horses.cpp:87:48: warning: declaration of 'y' shadows a global declaration [-Wshadow]
87 | void update2(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:14: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:87:41: warning: declaration of 'x' shadows a global declaration [-Wshadow]
87 | void update2(int l, int r, int idx, int x, int y) {
| ~~~~^
horses.cpp:10:4: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:94:29: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
94 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~^
horses.cpp:94:40: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
94 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~~~^
horses.cpp: In function 'void update3(int, int, int, int)':
horses.cpp:98:41: warning: declaration of 'x' shadows a global declaration [-Wshadow]
98 | void update3(int l, int r, int idx, int x) {
| ~~~~^
horses.cpp:10:4: note: shadowed declaration is here
10 | ll x[500001],y[500001];
| ^
horses.cpp:105:29: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
105 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~^
horses.cpp:105:40: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
105 | s[idx]=check(s[2*idx],s[2*idx+1]);
| ~~~~~~~~~^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:118:36: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
118 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~^
horses.cpp:118:47: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
118 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:128:33: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
128 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~^
horses.cpp:128:44: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
128 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:137:33: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
137 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~^
horses.cpp:137:44: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
137 | return (query_ms2(0,n-1,1,0,s[1])*y[s[1]])%mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
/usr/bin/ld: /tmp/ccOcLoij.o: in function `main':
grader.c:(.text.startup+0x0): multiple definition of `main'; /tmp/ccW863uf.o:horses.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status