답안 #228095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228095	2020-04-29T21:08:34 Z	caoash	Gap (APIO16_gap)	C++14	100 / 100	79 ms	3284 KB

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include "gap.h"
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
 
ll findGap1(int T, int N) {
   ll l,r;
   MinMax(0LL,INF,&l,&r);
   vl arr;
   ll BLK = ceil((r-l)/(N-1));
   ll pos = l+1;
   arr.pb(l); arr.pb(r);
   while(pos < r-1){
    ll a,b; 
    MinMax(pos, min(pos+BLK, r-1), &a, &b);
    if(a != -1){
        arr.pb(a);
        arr.pb(b);
    }
    pos += (BLK+1);
   }
   sort(all(arr));
   ll ans = -INF;
   for(int i = 0; i < sz(arr)-1; i++){
    ckmax(ans, arr[i+1]-arr[i]);
   }
   return ans;
}
 
long long int findGap2(int T, int N) {
   long long int low, high;
   MinMax(0LL,INF,&low,&high);
   ll ans = -INF;
   fax(i,((N+1)/2)-1){
      long long int nlow, nhigh;
      MinMax(low+1,high-1,&nlow,&nhigh);
      ckmax(ans, nlow-low);
      ckmax(ans, high-nhigh);
      low = nlow; high = nhigh;
   }
   ckmax(ans, high-low);
   return ans;
}
 
ll findGap(int T, int N){
	if(T == 1){
		findGap2(T,N);	
	}
	else{
		findGap1(T,N);
	}
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:193:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gap.cpp: In function 'void io::setIn(std::__cxx11::string)':
gap.cpp:132:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
gap.cpp: In function 'void io::setOut(std::__cxx11::string)':
gap.cpp:133:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	19 ms	512 KB	Output is correct
17	Correct	16 ms	512 KB	Output is correct
18	Correct	19 ms	512 KB	Output is correct
19	Correct	17 ms	488 KB	Output is correct
20	Correct	12 ms	512 KB	Output is correct
21	Correct	53 ms	1144 KB	Output is correct
22	Correct	51 ms	1160 KB	Output is correct
23	Correct	52 ms	1144 KB	Output is correct
24	Correct	52 ms	1144 KB	Output is correct
25	Correct	45 ms	1144 KB	Output is correct
26	Correct	53 ms	1068 KB	Output is correct
27	Correct	51 ms	1144 KB	Output is correct
28	Correct	62 ms	1144 KB	Output is correct
29	Correct	53 ms	1144 KB	Output is correct
30	Correct	38 ms	1152 KB	Output is correct
31	Correct	4 ms	384 KB	Output is correct
32	Correct	4 ms	384 KB	Output is correct

Subtask #2
70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	20 ms	896 KB	Output is correct
17	Correct	20 ms	896 KB	Output is correct
18	Correct	20 ms	952 KB	Output is correct
19	Correct	24 ms	896 KB	Output is correct
20	Correct	12 ms	512 KB	Output is correct
21	Correct	79 ms	2264 KB	Output is correct
22	Correct	71 ms	2288 KB	Output is correct
23	Correct	70 ms	2280 KB	Output is correct
24	Correct	71 ms	2264 KB	Output is correct
25	Correct	65 ms	3284 KB	Output is correct
26	Correct	77 ms	2288 KB	Output is correct
27	Correct	77 ms	2332 KB	Output is correct
28	Correct	70 ms	2288 KB	Output is correct
29	Correct	72 ms	2288 KB	Output is correct
30	Correct	37 ms	1528 KB	Output is correct
31	Correct	4 ms	384 KB	Output is correct
32	Correct	5 ms	360 KB	Output is correct

답안 #228095

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 70.0 / 70.0

Subtask #1
30.0 / 30.0

Subtask #2
70.0 / 70.0