結果
問題 | No.743 Segments on a Polygon |
ユーザー |
|
提出日時 | 2020-07-16 02:14:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 2,171 bytes |
コンパイル時間 | 1,944 ms |
コンパイル使用メモリ | 132,564 KB |
最終ジャッジ日時 | 2025-01-11 21:21:30 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:79:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 79 | int n, m; scanf("%d %d", &n, &m); | ~~~~~^~~~~~~~~~~~~~~~~ main.cpp:82:24: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 82 | int a, b; scanf("%d %d", &a, &b); | ~~~~~^~~~~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }//constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;const long double PI = acos((long double)(-1));using namespace std;typedef unsigned long long ull;typedef long long ll;typedef long double ld;template<typename T>struct BIT {int n;vector<T> bit;BIT() :n(0) {}BIT(int _n) :n(_n) { bit = vector<T>(n + 1); }void add1(int idx, T val) {for (int i = idx; i <= n; i += i & -i) bit[i] += val;}T sum1(int idx) {T res = 0;for (int i = idx; i > 0; i -= i & -i) res += bit[i];return res;}//0-indexedvoid add(int idx, T val) { add1(idx + 1, val); }//0-indexed [left, right)T sum(int left, int right) { return sum1(right) - sum1(left); }int lower_bound(T x) {int res = 0;int k = 1;while (2 * k <= n) k <<= 1;for (; k > 0; k >>= 1) {if (res + k <= n and bit[res + k] < x) {x -= bit[res + k];res += k;}}return res;}};int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/int n, m; scanf("%d %d", &n, &m);vector<pair<int, int>> vp(n);for (int i = 0; i < n; i++) {int a, b; scanf("%d %d", &a, &b);if (a > b) swap(a, b);vp[i] = { a,b };}sort(vp.begin(), vp.end());ll res = 0;BIT<ll> bit(m);for (int i = 0; i < n; i++) {res += bit.sum(vp[i].first, vp[i].second);bit.add(vp[i].second, 1);}cout << res << endl;return 0;}