제출 #1199517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199517		sula2	Gap (APIO16_gap)	C++20	컴파일 에러	0 ms	0 KiB

gap

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "gap.h"
#define bitcount __builtin_popcount
#define all(a) a.begin(), a.end()
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;

long long findGap(int t, int n) {
    long long mn = -1, mx = 1e18+1;
    vector<long long> a;
    while (mn != -1) {
        MinMax(mn + 1, mx - 1, mn, mx);
        if (mn == -1) break;
        a.push_back(mn);
        a.push_back(mx);
    }
    sort(all(a));
    long long res = 0;
    for (int i = 1; i < a.size(); i++)
        res = max(res, a[i] - a[i-1]);
    return res;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:16:32: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
   16 |         MinMax(mn + 1, mx - 1, mn, mx);
      |                                ^~
      |                                |
      |                                long long int
In file included from gap.cpp:4:
gap.h:1:35: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                   ^~~~~~~~~~
gap.cpp:16:36: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
   16 |         MinMax(mn + 1, mx - 1, mn, mx);
      |                                    ^~
      |                                    |
      |                                    long long int
In file included from gap.cpp:4:
gap.h:1:47: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                               ^~~~~~~~~~