제출 #1351939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1351939		Ice_man	커다란 상품 (IOI17_prize)	C++20	컴파일 에러	0 ms	0 KiB

prize

#include "prize.h"

/**
____    ____    ____    __________________    ____    ____    ____
||I ||  ||c ||  ||e ||  ||                ||  ||M ||  ||a ||  ||n ||
||__||  ||__||  ||__||  ||________________||  ||__||  ||__||  ||__||
|/__\|  |/__\|  |/__\|  |/________________\|  |/__\|  |/__\|  |/__\|

*/

#include <algorithm>
#include <iostream>
#include <vector>
#include <random>

#define maxn 200005

#define PB push_back
#define X first
#define Y second

typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, ll> pil;
typedef std::pair<ll, int> pli;
typedef long double ld;



ll suff[maxn];
ll pref[maxn];
ll res[maxn];

int find_best(int n)
{
    for (int i = 0; i < n; i++)
    {
        suff[i] = 0;
        pref[i] = 0;
        res[i] = 0;
    }

    std::mt19937 rng(69420);
    std::uniform_int_distribution<> dist(0, n - 1);
    int br = 10000;

    while (br--)
    {
        int pos = dist(rng);
        std::vector <int> res = ask(pos);

        pref[i] += res[0];
        suff[i] += res[1];
    }

    ll ss = 0;
    for (int i = 0; i < n; i++)
    {
        res[i] = ss;
        ss += suff[i];
    }

    ss = 0;
    for (int i = n - 1; i >= 0; i++)
    {
        res[i] = ss;
        ss += pref[i];
    }

    for (int i = 0; i < n; i++)
        res[i] = pref[i] + suff[i];

    int maxx = 0;
    for (int i = 1; i < n; i++)
        if (res[i] > res[maxx])
            maxx = i;

    return maxx;
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int find_best(int)':
prize.cpp:53:14: error: 'i' was not declared in this scope
   53 |         pref[i] += res[0];
      |              ^