結果
問題 | No.789 範囲の合計 |
ユーザー | kurarrr |
提出日時 | 2019-02-13 14:51:14 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 78 ms / 1,000 ms |
コード長 | 3,231 bytes |
コンパイル時間 | 1,591 ms |
コンパイル使用メモリ | 170,192 KB |
実行使用メモリ | 8,344 KB |
最終ジャッジ日時 | 2024-09-13 09:59:21 |
合計ジャッジ時間 | 2,923 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 72 ms
7,956 KB |
testcase_03 | AC | 45 ms
7,832 KB |
testcase_04 | AC | 67 ms
8,088 KB |
testcase_05 | AC | 57 ms
8,220 KB |
testcase_06 | AC | 62 ms
8,000 KB |
testcase_07 | AC | 39 ms
7,832 KB |
testcase_08 | AC | 50 ms
7,832 KB |
testcase_09 | AC | 46 ms
7,832 KB |
testcase_10 | AC | 78 ms
8,344 KB |
testcase_11 | AC | 64 ms
7,960 KB |
testcase_12 | AC | 62 ms
7,956 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In function ‘void _main()’: main.cpp:65:15: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 65 | int N; scanf("%d",&N); | ~~~~~^~~~~~~~~ main.cpp:67:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 67 | rep(i,N) scanf("%lld %lld %lld",&p[i],&q[i],&r[i]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include "bits/stdc++.h" #define ALL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define RREP(i, x, n) for(int i = x; i >= n; i--) #define rrep(i, n) RREP(i,n,0) #define pb push_back #pragma GCC optimize ("-O3") using namespace std; // #define DEBUG_IS_VALID #ifdef DEBUG_IS_VALID #define DEB 1 #else #define DEB 0 #endif #define DUMPOUT cout #define dump(...) if(DEB) DUMPOUT<<" "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<" "; if(DEB) dump_func(__VA_ARGS__) template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;} template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; } template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;} template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; } void dump_func(){DUMPOUT << endl;} template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);} template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;} template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;} void _main(); int main(){ cin.tie(0); ios::sync_with_stdio(false); _main(); return 0;} using ll = long long; using P = pair<int,int>; using Pl = pair<ll,ll>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; const int mod=1e9+7,INF=1<<29; const double EPS=1e-12,PI=3.1415926535897932384626; const ll lmod = 1e9+7,LINF=1LL<<59; template <typename T> class FenwickTree { const int n; vector<T> data; public: FenwickTree(int n) : n(n), data(n, 0) {} void add(int i, T value) { for (; i < n; i |= i + 1) data[i] += value; } T sum(int i) const { // sum of [0,i] T res = 0; for (; i >= 0; i = (i & (i + 1)) - 1) res += data[i]; return res; } T sum(int l, int r) const { return sum(r - 1) - sum(l - 1); } }; void _main(){ int N; scanf("%d",&N); vl p(N),q(N),r(N); rep(i,N) scanf("%lld %lld %lld",&p[i],&q[i],&r[i]); vl pos; rep(i,N){ if(p[i]==0) pos.pb(q[i]); else pos.pb(q[i]), pos.pb(r[i]); } sort(ALL(pos)); pos.erase(unique(ALL(pos)),pos.end()); int M = pos.size(); FenwickTree<ll> tree(M+2); auto pos_idx = [&](ll x){ return int(lower_bound(pos.begin(),pos.end(),x)-pos.begin()); }; int i1,i2; ll ans = 0; rep(i,N){ if(p[i]==0){ i1 = pos_idx(q[i]); tree.add(i1,r[i]); }else{ i1 = pos_idx(q[i]); i2 = pos_idx(r[i]); ans += tree.sum(i1,i2+1); } } cout << ans << endl; }