結果
問題 | No.989 N×Mマス計算(K以上) |
ユーザー |
![]() |
提出日時 | 2020-02-14 22:11:54 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 4,047 bytes |
コンパイル時間 | 1,726 ms |
コンパイル使用メモリ | 173,376 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-06 12:18:41 |
合計ジャッジ時間 | 2,627 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#define trace1(a) cout<<#a<<": "<<a<<endl#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)#define trace5(a,b,c,d,e) cout<<#a<<": "<<a<<" | ", trace4(b,c,d,e)#define trace6(a,b,c,d,e,f) cout<<#a<<": "<<a<<" | ", trace5(b,c,d,e,f)#define trace7(a,b,c,d,e,f,g) cout<<#a<<": "<<a<<" | ", trace6(b,c,d,e,f,g)#define trace8(a,b,c,d,e,f,g,h) cout<<#a<<": "<<a<<" | ", trace7(b,c,d,e,f,g,h)#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)#define rrep(i,a,b) for(int i=(int)(a);i>=(int)(b);--i)#define fore(x,a) for(auto &x:a)#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()#define isin(i,a,b) ((a) <= (i) && (i) <= (b))#define uni(a) (a).erase(unique(all(a)),(a).end())#define dup(x,y) (((x)+(y)-1)/(y))#define fi first#define se second#define pb push_back#define eb emplace_back#define sz(a) ((long long)(a).size())#define v(T) vector<T>#define vv(T) v(v(T))using namespace std;using ll = long long; using vi = vector<int>;using unit= unsigned; using vl = vector<ll>;using ull = unsigned long long; using vvi = vector<vi>;using pii = pair<int,int>; using vvl = vector<vl>;using pll = pair<ll,ll>; using vp = vector<pii>;void _main(); int main(){ cin.tie(0); ios::sync_with_stdio(false); _main(); }template<class T>string join(const v(T)&v){ stringstream s; rep(i,0,sz(v))s<<' '<<v[i]; return s.str().substr(1); }template<class T>istream &operator>>(istream&i, v(T)&v){ fore(x,v){ i >> v; } return i; }template<class T>ostream &operator<<(ostream&o, const v(T)&v){ o<<"["; fore(x,v)o<<x<<","; o<<"]"; return o; }template<class T>ostream &operator<<(ostream&o, const deque<T>&v){ o<<"deq["; fore(x,v)o<<x<<","; o<<"]"; return o; }template<class T>ostream &operator<<(ostream&o, const set<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }template<class T>ostream &operator<<(ostream&o, const unordered_set<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }template<class T>ostream &operator<<(ostream&o, const multiset<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }template<class T>ostream &operator<<(ostream&o, const unordered_multiset<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }template<class T1,class T2>ostream &operator<<(ostream &o, const pair<T1,T2>&p){ o<<"("<<p.fi<<","<<p.se<<")"; return o; }template<class TK,class TV>ostream &operator<<(ostream &o, const map<TK,TV>&m){ o<<"{"; fore(x,m)o<<x.fi<<"=>"<<x.se<<","; o<<"}"; return o; }template<class TK,class TV>ostream &operator<<(ostream &o, const unordered_map<TK,TV>&m){ o<<"{"; fore(x,m)o<<x.fi<<"=>"<<x.se<<","; o<<"}"; return o;}template<class T>void YES(T c){ if(c) cout<<"YES"<<endl; else cout<<"NO"<<endl; }template<class T>void Yes(T c){ if(c) cout<<"Yes"<< endl; else cout<<"No"<<endl; }template<class T>void POSS(T c){ if(c) cout<<"POSSIBLE"<<endl; else cout<<"IMPOSSIBLE"<<endl; }template<class T>void Poss(T c){ if(c) cout<<"Possible"<<endl; else cout<<"Impossible"<<endl; }template<class T>void chmax(T &a, const T &b){ if(a<b) a=b; }template<class T>void chmin(T &a, const T &b){ if(b<a) a=b; }template<class T>T gcd(T a, T b){ return b?gcd(b,a%b):a; }template<class T>T lcm(T a, T b){ return a/gcd(a,b)*b; }const double EPS = 1e-10;const double PI = acos(-1.0);const int INF = 1001002003;const ll LINF= 1001002003004005006LL;const int dx[] = { -1, 0, 1, 0 , -1,-1, 1, 1 };const int dy[] = { 0, 1, 0,-1 , -1, 1,-1, 1 };void _main() {int N, M, K;char op;cin >> N >> M >> K >> op;vl a(N), b(M);fore(x, b) cin >> x;fore(x, a) cin >> x;sort(all(b));if (op == '+') {ll ans = 0;fore(x, a) ans += b.end() - lower_bound(all(b), K-x);cout << ans << endl;} else {ll ans = 0;fore(x, a) ans += b.end() - lower_bound(all(b), dup(K, x));cout << ans << endl;}}