제출 #1182648

#제출 시각아이디문제언어결과실행 시간메모리
1182648SulAGap (APIO16_gap)C++20
컴파일 에러
0 ms0 KiB
#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; long long findGap(int t, int n) { long long l = -1, r = 1e18+1, mn, mx; vector<long long> a; while (l <= r) { MinMax(l, r, mn, mx); a.push_back(mn); a.push_back(mx); l = mn + 1; r = mx - 1; } sort(all(a)); long long ans = 0; for (int i = 0; i+1 < a.size(); i++) ans = max(ans, a[i+1] - a[i]); return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:15:22: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
   15 |         MinMax(l, r, 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:15:26: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
   15 |         MinMax(l, r, 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*);
      |                                               ^~~~~~~~~~