結果
問題 | No.2248 max(C)-min(C) |
ユーザー | ゆにぽけ |
提出日時 | 2023-10-09 15:40:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,073 ms / 3,000 ms |
コード長 | 3,417 bytes |
コンパイル時間 | 1,748 ms |
コンパイル使用メモリ | 144,404 KB |
実行使用メモリ | 95,896 KB |
最終ジャッジ日時 | 2023-10-09 15:40:46 |
合計ジャッジ時間 | 30,532 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,492 KB |
testcase_01 | AC | 2 ms
5,624 KB |
testcase_02 | AC | 2 ms
5,480 KB |
testcase_03 | AC | 3 ms
5,824 KB |
testcase_04 | AC | 3 ms
5,760 KB |
testcase_05 | AC | 2 ms
5,600 KB |
testcase_06 | AC | 5 ms
6,180 KB |
testcase_07 | AC | 5 ms
6,376 KB |
testcase_08 | AC | 5 ms
6,336 KB |
testcase_09 | AC | 5 ms
6,340 KB |
testcase_10 | AC | 3 ms
5,708 KB |
testcase_11 | AC | 6 ms
6,392 KB |
testcase_12 | AC | 3 ms
5,920 KB |
testcase_13 | AC | 4 ms
6,052 KB |
testcase_14 | AC | 5 ms
6,372 KB |
testcase_15 | AC | 5 ms
6,320 KB |
testcase_16 | AC | 3 ms
5,860 KB |
testcase_17 | AC | 5 ms
6,260 KB |
testcase_18 | AC | 769 ms
84,688 KB |
testcase_19 | AC | 57 ms
15,536 KB |
testcase_20 | AC | 922 ms
95,864 KB |
testcase_21 | AC | 854 ms
91,620 KB |
testcase_22 | AC | 533 ms
64,552 KB |
testcase_23 | AC | 309 ms
43,356 KB |
testcase_24 | AC | 96 ms
20,092 KB |
testcase_25 | AC | 799 ms
87,848 KB |
testcase_26 | AC | 715 ms
77,356 KB |
testcase_27 | AC | 772 ms
87,120 KB |
testcase_28 | AC | 41 ms
13,276 KB |
testcase_29 | AC | 709 ms
80,116 KB |
testcase_30 | AC | 217 ms
35,444 KB |
testcase_31 | AC | 908 ms
95,840 KB |
testcase_32 | AC | 114 ms
22,208 KB |
testcase_33 | AC | 208 ms
33,000 KB |
testcase_34 | AC | 902 ms
95,772 KB |
testcase_35 | AC | 923 ms
95,888 KB |
testcase_36 | AC | 910 ms
95,896 KB |
testcase_37 | AC | 396 ms
51,744 KB |
testcase_38 | AC | 946 ms
88,180 KB |
testcase_39 | AC | 944 ms
88,120 KB |
testcase_40 | AC | 946 ms
88,112 KB |
testcase_41 | AC | 784 ms
76,104 KB |
testcase_42 | AC | 948 ms
88,340 KB |
testcase_43 | AC | 811 ms
79,684 KB |
testcase_44 | AC | 957 ms
88,236 KB |
testcase_45 | AC | 683 ms
70,084 KB |
testcase_46 | AC | 321 ms
40,648 KB |
testcase_47 | AC | 963 ms
88,160 KB |
testcase_48 | AC | 360 ms
58,260 KB |
testcase_49 | AC | 1,031 ms
95,820 KB |
testcase_50 | AC | 1,060 ms
95,792 KB |
testcase_51 | AC | 1,073 ms
95,832 KB |
testcase_52 | AC | 1,061 ms
95,776 KB |
testcase_53 | AC | 111 ms
20,076 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<bitset> #include<random> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; //using mint = modint<998244353>; using mint = modint<1000000007>; int N,A[2 << 17],B[2 << 17],cnt[2 << 17],P[2 << 17][3]; void solve() { cin >> N; for(int i = 0;i < N;i++) cin >> A[i]; for(int i = 0;i < N;i++) cin >> B[i]; vector<int> V; map<int,multiset<int>> mp; V.reserve(3*N); int mx = -1; for(int i = 0;i < N;i++) { V.push_back(A[i]); V.push_back(B[i]); V.push_back((A[i]+B[i])/2); P[i][0] = A[i],P[i][1] = B[i],P[i][2] = (A[i]+B[i])/2; sort(P[i],P[i]+3); mp[A[i]].insert(i); mp[B[i]].insert(i); mp[(A[i]+B[i])/2].insert(i); mx = max(mx,min(min(A[i],B[i]),(A[i]+B[i])/2)); } sort(V.begin(),V.end()); V.erase(unique(V.begin(),V.end()),V.end()); int ans = mx-V[0]; for(int i = 1;i+1 < (int)V.size();i++) { bool fin = false; for(int id:mp[V[i-1]]) { if(++cnt[id] == 3) { fin = true; break; } mx = max(mx,P[id][cnt[id]]); } if(fin) break; ans = min(ans,mx-V[i]); } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) solve(); }