Submission #348801

#	Time	Username	Problem	Language	Result	Execution time	Memory
348801		Sprdalo	Horses (IOI15_horses)	C++17	0 / 100	24 ms	16364 KiB

horses

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

const int mod = 1e9 + 7;

void f(ll& x){
    if (x >= mod)
        x %= mod;
}

ll g(ll x){
    f(x);
    return x;
}

vi x, y;
int n;

int solve(){
    ll sol = 0, s = 1;
    for (int i = 0; i < n; ++i){
        s *= x[i];
        f(s);
        sol = max(sol, g(s * y[i]));
    }
}

int init(int N, int X[], int Y[]){
    n = N;
    x = vi(n); y = vi(n);
    for (int i = 0; i < n; ++i){
        x[i] = X[i];
        y[i] = Y[i];
    }

    return solve();
}

int updateX(int pos, int val){
    x[pos] = val;
    return solve();
}

int updateY(int pos, int val){
    y[pos] = val;
    return solve();
}
/*
int main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    int n;
    cin >> n;

    int x[n], y[n];
    for (int i = 0; i < n; ++i)
        cin >> x[i] >> y[i];

    cout << init(n,x,y) << '\n';
}*/

Compilation message (stderr)

horses.cpp: In function 'int solve()':
horses.cpp:40:1: warning: no return statement in function returning non-void [-Wreturn-type]
   40 | }
      | ^

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23