結果
問題 | No.989 N×Mマス計算(K以上) |
ユーザー |
![]() |
提出日時 | 2020-02-14 21:32:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 2,465 bytes |
コンパイル時間 | 1,381 ms |
コンパイル使用メモリ | 134,372 KB |
最終ジャッジ日時 | 2025-01-09 00:03:31 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <cassert>#include <algorithm>#include <array>#include <bitset>#include <cctype>#include <cstdint>#include <cmath>#include <complex>#include <chrono>#include <deque>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <numeric>#include <queue>#include <set>#include <stack>#include <string>#include <unordered_map>#include <vector>#include <random>#include <memory>#include <utility>#include <limits>#include "limits.h"#define rep(i, a, b) for (long long (i) = (a); (i) < (b); (i)++)#define all(i) i.begin(), i.end()#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)void debug_out(){std::cerr<<std::endl;}template<typename Head,typename... Tail>void debug_out(Head h,Tail... t){std::cerr<<" "<<h;debug_out(t...);}template <typename T1, typename T2>std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {return os << pa.first << " " << pa.second;}template <typename T>std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template<typename T1,typename T2>inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}template<typename T1,typename T2>inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}long long pow_mod(long long a, long long b, long long mod=-1) {if(b==0)return 1;if ((a == 0)||(mod!=-1&&(a+mod)%mod==0)) {return 0;}long long x = 1;while (b > 0) {if (b & 1) {x = (mod!=-1)?(x * a) % mod:x*a;}a = (mod!=-1)?(a * a) % mod:a*a;b >>= 1;}return x;}// const long long MOD = 998244353;const long long MOD = 1e9 + 7;using ll = long long;using P=std::pair<long long,long long>;int main() {std::cin.tie(nullptr);std::ios::sync_with_stdio(false);ll n,m,k;std::cin>>n>>m>>k;char op;std::cin>>op;std::vector<ll> b(m),a(n);rep(i,0,m)std::cin>>b[i];rep(i,0,n)std::cin>>a[i];std::sort(all(a));std::sort(all(b));if(op=='+'){ll ans=0;rep(i,0,n){ans+=b.end()-std::lower_bound(all(b),k-a[i]);}std::cout<<ans<<"\n";}else{ll ans=0;rep(i,0,n){ll left=-1,right=m;while(right-left>1){ll mid=left+(right-left)/2;if(b[mid]*a[i]>=k)right=mid;else left=mid;}ans+=m-right;}std::cout<<ans<<"\n";}return 0;}