제출 #580610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
580610		Sam_a17	Gap (APIO16_gap)	C++14	100 / 100	60 ms	1900 KiB

gap

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = 1e18;
#include "gap.h"

long long findGap(int T, int N) {
  if(T == 1) {
    vector<long long> a(N);
    long long mn, mx;

    MinMax(0, inf, &mn, &mx);
    
    a[0] = mn, a[N - 1] = mx;
    long long lstMn = mn, lstMx = mx;
    for(int i = 1; i < N / 2; i++) {
      MinMax(lstMn + 1, lstMx - 1, &mn, &mx);
      a[i] = mn, a[N - i - 1] = mx;
      lstMn = mn, lstMx = mx;
    }

    if(N & 1) {
      int mid = N / 2;
      MinMax(lstMn + 1, max(lstMn + 1, lstMx - 1), &mn, &mx);
      assert(mn == mx);
      a[N / 2] = mn;
    }

    long long answ = 0;
    for(int i = 1; i < N; i++) {
      answ = max(answ, a[i] - a[i - 1]);
    }

    return answ;
  } else {
    long long mn, mx;
    MinMax(0, inf, &mn, &mx);
    long long pos = (mx - mn + N - 2) / (N - 1), ans = pos;
    long long x, y, i, l = mn;
    for (i = mn; i < mx; i += pos + 1) {
      MinMax(i, i + pos, &x, &y);
      if (x != -1) {
        ans = max(ans, x-l);
        l = y;
      }
    }
    
    return ans;
  }

  return 0;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:88:11: warning: unused variable 'mid' [-Wunused-variable]
   88 |       int mid = N / 2;
      |           ^~~
gap.cpp: In function 'void setIO(std::string)':
gap.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70