結果
問題 | No.743 Segments on a Polygon |
ユーザー |
![]() |
提出日時 | 2018-10-14 15:15:10 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 3,503 bytes |
コンパイル時間 | 1,443 ms |
コンパイル使用メモリ | 128,376 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-14 12:41:03 |
合計ジャッジ時間 | 2,803 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
#define _USE_MATH_DEFINES#include <iostream>#include <fstream>#include <cstdio>#include <cmath>#include <cstdlib>#include <cstring>#include <cassert>#include <string>#include <vector>#include <utility>#include <complex>#include <set>#include <map>#include <queue>#include <stack>#include <deque>#include <tuple>#include <bitset>#include <limits>#include <algorithm>#include <array>#include <random>#include <complex>#include <regex>using namespace std;typedef long double ld;typedef long long ll;typedef vector<int> vint;typedef vector<ll> vll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;typedef pair<double, double> pdd;typedef complex<ld> compd;#define quickIO() {cin.tie(0); cout.sync_with_stdio(false);}#define reach(i,a) for(auto i:a)#define rep(i,n) for(int i=0;i<((int)n);i++)#define REP(i,n) for(int i=0;i<=((int)n);i++)#define srep(i,a,n) for(int i=a;i<((int)n);i++)#define SREP(i,a,n) for(int i=a;i<=((int)n);i++)#define rrep(i,n) for(int i=n-1;i>=0;i--)#define RREP(i,n) for(int i=n;i>=0;i--)#define all(a) (a).begin(),(a).end()#define mp(a,b) make_pair(a,b)#define mt make_tuple#define pb push_backtemplate<typename T> istream& operator >> (istream& is, vector<T>& vec) {for (T& x : vec) is >> x;return is;}template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {os << "[";rep(i, vec.size()) os << (i ? ", " : "") << vec[i];os << "]";return os;}template<typename T> istream& operator >> (istream& is, pair<T, T>& p) {is >> p.first >> p.second;return is;}template<typename T> ostream& operator << (ostream& os, pair<T, T>& p) {os << "(" << p.first << ", " << p.second << ")";return os;}int bitcnt(ll x) {x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);return x;}int bitcnt(int x) {x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);return x;}ll sqrtll(ll x) {ll left = 0, right = x;rep(i, 100) {ll mid = (left + right) >> 1;if (mid*mid <= x) left = mid;else right = mid;}return left;}ll gcd(ll a, ll b) {return a % b == 0 ? b : gcd(b, a%b);}#define debug(x) printf("Case #%d: ", x)#define DEBUG 0const ll inf = 1e18;const ld infl = 1e100;const ll mod = 1e9+7;const ld eps = 1e-9;const int dx[] = { 1,0,-1,0,0 };const int dy[] = { 0,1,0,-1,0 };class BIT {public:vll bit;int N;BIT(int n) {N = n;bit = vll(n+1);}void add(int k, int a = 1) {while (k <= N) {bit[k] += a;k += k & -k;}}int get(int k) {int ret = 0;while (k > 0) {ret += bit[k];k -= k & -k;}return ret;}void out() {SREP(i, 1, N) cout << get(i) << " ";cout << endl;}};int main() {int n,m; cin >> n >> m;vector<pii> v(n);rep(i, n) {int a, b; cin >> a >> b; a++; b++;v[i] = mp(min(a, b), max(a, b));}sort(all(v));BIT bit(m);ll ret = 0;for (auto it : v) {ret += bit.get(it.second) - bit.get(it.first);bit.add(it.second);}cout << ret << endl;return 0;}