oj.uz

답안 #834285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834285 2023-08-22T12:37:57 Z Ellinor 말 (IOI15_horses) C++14
0 / 100
 1500 ms 12036 KB 
//#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <cstdlib>
#include <set>
#include <iomanip>
#include <limits>
#include <map>
#include <assert.h>
#include <algorithm>
#include <list>
#include <iterator>
#include <fstream>
#include <random>
#include <unordered_map>
#include <array>
using namespace std;

#define rep(i,a,b) for (int i = (a); i < b; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;

ll MOD = 1e9 + 7; // !?

// fast

//

#include "horses.h" // !

int n;
vector<ll> x, y;

int go()
{
    ll ch = 1, tmp = 1e9;
    int sind = -1;
    for (int i = n - 1; i >= 0; i--)
    {
        ch *= x[i];
        if (ch > tmp) {
            sind = i; // :/
            break;
        }
    }

    ll ans, tmp1;
    ll horses = 1;
    rep(i,sind,n) { // start on sind -1"
        horses *= x[i];
        tmp1 = horses * y[i];
        ans = max(ans, tmp1);
    }

    // sind -> 1
    // sind -> ?
    tmp = 1;
    rep(i,0,sind) {
        tmp *= x[i];
        tmp %= MOD;
    }

    ans = ans % MOD;
    ans *= tmp;
    ans = ans % MOD;
	return ans;
}

int init(int N, int X[], int Y[]) 
{
    n = N;
    x.assign(N, 0);
    y.assign(N, 0);
    rep(i,0,N) {
        x[i] = X[i];
        y[i] = Y[i];
    }

    return go();
}

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

    return go();
}

int updateY(int pos, int val) 
{
    y[pos] = val;

    return go();
}

// 17p, M = 0

Compilation message

horses.cpp: In function 'int go()':
horses.cpp:71:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   71 |  return ans;
      |         ^~~
horses.cpp:68:15: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     ans = ans % MOD;
      |           ~~~~^~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1548 ms 12036 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -