結果
問題 | No.2248 max(C)-min(C) |
ユーザー | noya2 |
提出日時 | 2023-03-17 22:20:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,216 ms / 3,000 ms |
コード長 | 4,415 bytes |
コンパイル時間 | 4,670 ms |
コンパイル使用メモリ | 278,456 KB |
実行使用メモリ | 81,384 KB |
最終ジャッジ日時 | 2023-10-18 15:18:12 |
合計ジャッジ時間 | 37,425 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 3 ms
4,348 KB |
testcase_04 | AC | 3 ms
4,348 KB |
testcase_05 | AC | 3 ms
4,348 KB |
testcase_06 | AC | 5 ms
4,580 KB |
testcase_07 | AC | 5 ms
4,692 KB |
testcase_08 | AC | 6 ms
4,692 KB |
testcase_09 | AC | 6 ms
4,692 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 5 ms
4,692 KB |
testcase_12 | AC | 4 ms
4,348 KB |
testcase_13 | AC | 5 ms
4,468 KB |
testcase_14 | AC | 5 ms
4,692 KB |
testcase_15 | AC | 6 ms
4,692 KB |
testcase_16 | AC | 3 ms
4,348 KB |
testcase_17 | AC | 5 ms
4,636 KB |
testcase_18 | AC | 1,025 ms
69,948 KB |
testcase_19 | AC | 85 ms
12,192 KB |
testcase_20 | AC | 1,193 ms
81,280 KB |
testcase_21 | AC | 1,126 ms
77,576 KB |
testcase_22 | AC | 728 ms
54,484 KB |
testcase_23 | AC | 428 ms
34,892 KB |
testcase_24 | AC | 141 ms
15,988 KB |
testcase_25 | AC | 1,071 ms
74,580 KB |
testcase_26 | AC | 922 ms
65,172 KB |
testcase_27 | AC | 1,034 ms
75,996 KB |
testcase_28 | AC | 64 ms
10,140 KB |
testcase_29 | AC | 947 ms
67,168 KB |
testcase_30 | AC | 324 ms
28,908 KB |
testcase_31 | AC | 1,182 ms
81,280 KB |
testcase_32 | AC | 165 ms
17,672 KB |
testcase_33 | AC | 298 ms
26,996 KB |
testcase_34 | AC | 1,211 ms
81,276 KB |
testcase_35 | AC | 1,216 ms
81,280 KB |
testcase_36 | AC | 1,203 ms
81,280 KB |
testcase_37 | AC | 546 ms
44,092 KB |
testcase_38 | AC | 1,120 ms
68,324 KB |
testcase_39 | AC | 1,117 ms
68,532 KB |
testcase_40 | AC | 1,125 ms
68,512 KB |
testcase_41 | AC | 948 ms
62,004 KB |
testcase_42 | AC | 1,107 ms
68,540 KB |
testcase_43 | AC | 951 ms
63,892 KB |
testcase_44 | AC | 1,090 ms
68,536 KB |
testcase_45 | AC | 818 ms
57,408 KB |
testcase_46 | AC | 387 ms
32,176 KB |
testcase_47 | AC | 1,119 ms
68,532 KB |
testcase_48 | AC | 294 ms
31,956 KB |
testcase_49 | AC | 1,188 ms
81,380 KB |
testcase_50 | AC | 1,174 ms
81,384 KB |
testcase_51 | AC | 1,188 ms
81,380 KB |
testcase_52 | AC | 1,209 ms
81,376 KB |
testcase_53 | AC | 143 ms
15,864 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for (int i = 0; i < int(n); ++i) #define repp(i,n,m) for (int i = m; i < int(n); ++i) #define reb(i,n) for (int i = int(n)-1; i >= 0; --i) #define all(v) v.begin(),v.end() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair<int, int>; using PL = pair<long long, long long>; using pdd = pair<long double, long double>; using pil = pair<int,ll>; using pli = pair<ll,int>; template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;} template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);} template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));} template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; } template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());} template<typename T1, typename T2>void print(pair<T1,T2> a); template<typename T>void print(vector<T> v); template<typename T>void print(vector<vector<T>> v); void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } void print(unsigned int a){ printf("%u", a); } void print(unsigned long long a) { printf("%llu", a); } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);} template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}} template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}} void yes(){out("Yes");} void no (){out("No");} void yn (bool t){if(t)yes();else no();} void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);} void o(){out("!?");} namespace noya2{ const int INF = 1001001007; const long long mod1 = 998244353; const long long mod2 = 1000000007; const long long inf = 2e18; const long double pi = 3.14159265358979323; const long double eps = 1e-7; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; } // namespace noya2 using namespace noya2; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; void out(mint a){out(a.val());} void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);} void out(vector<vector<mint>> a){for (auto v : a) out(v);} istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;} void solve(){ int n; cin >> n; map<ll,vector<int>> mp; vector<ll> a(n), b(n); cin >> a >> b; rep(i,n){ mp[a[i]].emplace_back(i); mp[b[i]].emplace_back(i); mp[a[i]/2+b[i]/2].emplace_back(i); } vector<int> ok(n,0); int cnt = 0; auto add = [&](int i){ if (ok[i]++ == 0) cnt++; }; auto del = [&](int i){ if (--ok[i] == 0) cnt--; }; ll ans = inf; vector<ll> val; for (auto p : mp) val.emplace_back(p.first); int siz = val.size(); int r = 0; rep(i,siz){ while (r < siz && cnt < n){ for (auto j : mp[val[r++]]) add(j); } if (cnt == n) chmin(ans,val[r-1]-val[i]); for (auto j : mp[val[i]]) del(j); } out(ans); } int main(){ fast_io(); int t = 1; //cin >> t; while(t--) solve(); }