結果
問題 | No.206 数の積集合を求めるクエリ |
ユーザー | is_eri23 |
提出日時 | 2015-05-09 10:54:00 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 6,252 ms / 7,000 ms |
コード長 | 2,815 bytes |
コンパイル時間 | 1,441 ms |
コンパイル使用メモリ | 167,012 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-05 21:09:39 |
合計ジャッジ時間 | 48,296 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,944 KB |
testcase_07 | AC | 4 ms
6,940 KB |
testcase_08 | AC | 5 ms
6,940 KB |
testcase_09 | AC | 5 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 9 ms
6,940 KB |
testcase_13 | AC | 7 ms
6,944 KB |
testcase_14 | AC | 4 ms
6,944 KB |
testcase_15 | AC | 3 ms
6,944 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 6,252 ms
6,944 KB |
testcase_18 | AC | 1,535 ms
6,944 KB |
testcase_19 | AC | 4,961 ms
6,944 KB |
testcase_20 | AC | 21 ms
6,940 KB |
testcase_21 | AC | 1,166 ms
6,940 KB |
testcase_22 | AC | 1,538 ms
6,940 KB |
testcase_23 | AC | 5,242 ms
6,944 KB |
testcase_24 | AC | 6,117 ms
6,940 KB |
testcase_25 | AC | 5,641 ms
5,376 KB |
testcase_26 | AC | 1,546 ms
5,376 KB |
testcase_27 | AC | 1,839 ms
5,376 KB |
testcase_28 | AC | 3,706 ms
5,376 KB |
testcase_29 | AC | 3,391 ms
5,376 KB |
testcase_30 | AC | 2,476 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>#define EPS 1e-9#define INF 1070000000LL#define MOD 1000000007LL#define fir first#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)#define numa(x,a) for(auto x: a)#define ite iterator#define mp make_pair#define rep(i,n) rep2(i,0,n)#define rep2(i,m,n) for(int i=m;i<(n);i++)#define pb push_back#define pf push_front#define sec second#define sz(x) ((int)(x).size())#define ALL( c ) (c).begin(), (c).end()#define gcd(a,b) __gcd(a,b)#define mem(x,n) memset(x,n,sizeof(x))#define endl "\n"using namespace std;template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t);deploy<POS + 1, TUPLE, Ts...>(os, t); }template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e <<(--remain == 0 ? "}" : ", "); return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain== 0 ? "}" : ", "); return os; }template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }using ll = long long;int memo[200100];int L,M,N;int ans[100100];int main(){cin.tie(0);ios_base::sync_with_stdio(0);cin >> L >> M >> N;vector <int> A(L);vector <int> B(M);rep(i,L){cin >> A[i];}rep(i,M){cin >> B[i];}sort(ALL(A));sort(ALL(B));mem(memo,-1);rep(i,M){memo[B[i]] = B[i];memo[B[i]+N+1] = -B[i];}deque <int> que;int ap = 0;//DEBUG1(A);//DEBUG1(B);rep(i,2*N+10){if (memo[i] != -1) {if (memo[i] > 0) {que.push_back(i);}else{que.pop_front();}}//DEBUG1(que);if (A[ap] == i) {for (auto &x : que) {ans[i-x] += 1;}ap += 1;if (ap == sz(A)) {break;}}}//outputint Q;cin >> Q;rep(i,Q){cout << ans[i] << endl;}return 0;}