結果
問題 | No.1597 Matrix Sort |
ユーザー |
![]() |
提出日時 | 2021-07-09 23:08:16 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,688 bytes |
コンパイル時間 | 1,648 ms |
コンパイル使用メモリ | 171,092 KB |
実行使用メモリ | 161,212 KB |
最終ジャッジ日時 | 2024-07-01 18:12:26 |
合計ジャッジ時間 | 7,794 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 WA * 2 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using pll = pair<ll, ll>;using tlll = tuple<ll, ll, ll>;constexpr ll MOD = 1e9 + 7;//constexpr ll MOD = 998244353;//constexpr ll MOD = ;ll mod(ll A, ll M) {return (A % M + M) % M;}constexpr ll INF = 1LL << 60;template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)ll N, K, P;vector<ll> A, B, S;void accum(vector<ll> &s){s.resize(2 * P, 0);for (ll i = 0; i < N; i++){s.at(A.at(i))++;s.at(P + A.at(i))++;}/*for (ll i = 0; i < 2 * P; i++){cerr << i << " " << s.at(i) << endl;}//*/for (ll i = 0; i < 2 * P - 1; i++){s.at(i + 1) += s.at(i);}}ll count(ll t){ll ret = 0;for (ll i = 0; i < N; i++){ll tmp = S.at(P + t - B.at(i)) - S.at(P - B.at(i) - 1);ret += tmp;}return ret;}bool isok(ll t){return count(t) >= K;}int main(){cin >> N >> K >> P;A.resize(N), B.resize(N);for (ll i = 0; i < N; i++){cin >> A.at(i);}for (ll i = 0; i < N; i++){cin >> B.at(i);}accum(S);/*for (ll i = 0; i < 2 * P; i++){cerr << i << " " << S.at(i) << endl;}//*/ll ng = 0, ok = P - 1;while (abs(ok - ng) > 1){ll mid = (ok + ng) / 2;if (isok(mid))ok = mid;elseng = mid;}cout << ok << endl;/*for (ll p = 0; p < P; p++){cerr << count(p) << endl;}//*/}