oj.uz

답안 #834200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834200 2023-08-22T11:50:31 Z Ellinor 말 (IOI15_horses) C++14
17 / 100
 1500 ms 12064 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 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];
    }

    //

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

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

	return ans % MOD;
}

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

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

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

	return ans % MOD;
}

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

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

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

	return ans % MOD;
}

// 17p, M = 0

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:53:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
   53 |         if (ch > 1e9) {
      |             ^~
horses.cpp:57:15: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   57 |         if (i = 0) sind = 0;
      |             ~~^~~
horses.cpp:62:11: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                 ~~~
......
   62 |     rep(i,sind,n) { // start on sind -1"
horses.cpp:22:34: note: in definition of macro 'rep'
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                  ^
horses.cpp:68:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   68 |  return ans % MOD;
      |         ~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:79:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
   79 |         if (ch > 1e9) {
      |             ^~
horses.cpp:83:15: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   83 |         if (i = 0) sind = 0;
      |             ~~^~~
horses.cpp:88:11: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                 ~~~
......
   88 |     rep(i,sind,n) { // start on sind -1"
horses.cpp:22:34: note: in definition of macro 'rep'
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                  ^
horses.cpp:94:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   94 |  return ans % MOD;
      |         ~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:105:13: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
  105 |         if (ch > 1e9) {
      |             ^~
horses.cpp:109:15: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  109 |         if (i = 0) sind = 0;
      |             ~~^~~
horses.cpp:114:11: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                 ~~~
......
  114 |     rep(i,sind,n) { // start on sind -1"
horses.cpp:22:34: note: in definition of macro 'rep'
   22 | #define rep(i,a,b) for (int i = (a); i < b; i++)
      |                                  ^
horses.cpp:120:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  120 |  return ans % MOD;
      |         ~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:88:9: warning: 'sind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   88 |     rep(i,sind,n) { // start on sind -1"
      |         ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:114:9: warning: 'sind' may be used uninitialized in this function [-Wmaybe-uninitialized]
  114 |     rep(i,sind,n) { // start on sind -1"
      |         ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:62:9: warning: 'sind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |     rep(i,sind,n) { // start on sind -1"
      |         ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 260 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 260 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -