#429785 (C++17) No.989 N×Mマス計算（K以上）

• 問題: No.989 N×Mマス計算（K以上）
• ユーザー: kuhaku
• 提出日時: 2020-02-14 21:42:50
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 61 ms / 2,000 ms
• コード長: 2,400 bytes
• コンパイル時間: 2,384 ms
• コンパイル使用メモリ: 201,080 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-16 01:41:03
• 合計ジャッジ時間: 3,501 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	40 ms; 5,376 KB
testcase_11	AC	36 ms; 5,376 KB
testcase_12	AC	43 ms; 5,376 KB
testcase_13	AC	24 ms; 5,376 KB
testcase_14	AC	61 ms; 5,376 KB
testcase_15	AC	18 ms; 5,376 KB
testcase_16	AC	33 ms; 5,376 KB
testcase_17	AC	23 ms; 5,376 KB
testcase_18	AC	24 ms; 5,376 KB
testcase_19	AC	37 ms; 5,376 KB

ソースコード

/*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void ce(const T n){cerr << n << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;

int main(void){
	ll n, m, k;
	cin >> n >> m >> k;
	string s;
	cin >> s;
	Vec a(n), b(m);
	rep(i, m) cin >> b[i];
	rep(i, n) cin >> a[i];

	sort(all(a));
	sort(all(b));

	ll ans = 0;
	rep(i, n){
		ll l;
		if(s == "+") l = k-a[i];
		else l = k/a[i]+!!(k%a[i]);
		ll p = lower_bound(all(b), l)-b.begin();
		ans += m-p;
	}
	co(ans);

	return 0;
}