結果
問題 | No.2687 所により大雨 |
ユーザー | karinohito |
提出日時 | 2024-03-20 22:50:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 3,638 bytes |
コンパイル時間 | 4,197 ms |
コンパイル使用メモリ | 271,360 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 08:58:23 |
合計ジャッジ時間 | 7,492 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
5,248 KB |
testcase_01 | AC | 30 ms
5,248 KB |
testcase_02 | AC | 31 ms
5,248 KB |
testcase_03 | AC | 31 ms
5,248 KB |
testcase_04 | AC | 32 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 176 ms
5,248 KB |
testcase_11 | AC | 192 ms
5,248 KB |
testcase_12 | AC | 191 ms
5,248 KB |
testcase_13 | AC | 195 ms
5,248 KB |
testcase_14 | AC | 186 ms
5,248 KB |
testcase_15 | AC | 180 ms
5,248 KB |
testcase_16 | AC | 183 ms
5,248 KB |
testcase_17 | AC | 179 ms
5,248 KB |
testcase_18 | AC | 181 ms
5,248 KB |
testcase_19 | AC | 178 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 1 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 1 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 2 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h>#include<atcoder/all>using namespace atcoder;using namespace std;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vvvvvb = vector<vvvvb>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}bool DEB = 0;using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;vector<mint> fact, factinv, inv, factK;const ll mod = 998244353;void prenCkModp(ll n) {//factK.resize(4*n+5);fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = (mod - ((inv[mod % i] * (mod / i))));factinv[i] = (factinv[i - 1] * inv[i]);}//factK[0]=1;//for(ll i=1;i<4*n+5;i++){// factK[i]=factK[i-1]*mint(K-i+1);// //K*(K-1)*...*(K-i+1);//}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * ((factinv[k] * factinv[n - k])));}mint nPk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * (factinv[n - k]));}//mint nCkK(ll n,ll k){// if(K<n||K-n<k)return 0;// mint res=factK[n+k];// res*=factK[n].inv();// res*=factinv[k];// return res;//}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N,M;cin>>N>>M;vector<pair<ll,ll>> P(N),Q(M);rep(i,N)cin>>P[i].first>>P[i].second;rep(i,M)cin>>Q[i].first>>Q[i].second;sort(all(P));sort(all(Q));ll K;cin>>K;rep(i,N-1){if(P[i].second>=P[i+1].first){rep(k,K)cout<<1<<" \n"[k==K-1];return 0;}}rep(i,M-1){if(Q[i].second>=Q[i+1].first){rep(k,K)cout<<1<<" \n"[k==K-1];return 0;}}vll D(K);rep(k,K)cin>>D[k];vll AN(K,0);rep(i,N){ll k=0;rep(j,M){ll LE=P[i].first+Q[j].first;ll RI=P[i].second+Q[j].second;while(LE>D[k]*2){k++;if(k==K)break;}while(RI>=D[k]*2&&LE<=D[k]*2){AN[k]=1;k++;if(k==K)break;}if(k==K)break;}}rep(k,K)cout<<AN[k]<<" \n"[k==K-1];//cout<<"MADA"<<endl;}