結果
| 問題 |
No.1282 Display Elements
|
| コンテスト | |
| ユーザー |
👑  null
|
| 提出日時 | 2020-11-06 23:32:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 85 ms / 2,000 ms |
| コード長 | 4,209 bytes |
| コンパイル時間 | 1,668 ms |
| コンパイル使用メモリ | 143,324 KB |
| 最終ジャッジ日時 | 2025-01-15 21:17:05 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 24 |
コンパイルメッセージ
main.cpp: In function ‘void scans(std::string&)’:
main.cpp:77:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
77 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:78:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
78 | if (c == '\n')scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:81:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
81 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scanc(char&)’:
main.cpp:87:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
87 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:90:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
90 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:163:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
163 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
main.cpp:165:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
165 | rep(i, n)scanf("%d", &a[i]);
| ~~~~~^~~~~~~~~~~~~
main.cpp:166:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
166 | rep(i, n)scanf("%d", &b[i]);
| ~~~~~^~~~~~~~~~~~~
ソースコード
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
////多倍長整数, cpp_intで宣言
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
//
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printLdb(a) printf("%.50Lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) //string出力
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
#define inf numeric_limits<double>::infinity();
#define linf numeric_limits<long double>::infinity()
using ll = long long;
using ull = unsigned long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);
using namespace std;
void scans(string& str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')scanf("%c", &c);
while (c != '\n' && c != -1 && c != ' ') {
str += c;
scanf("%c", &c);
}
}
void scanc(char& str) {
char c;
scanf("%c", &c);
if (c == -1)return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) {
return PI / 2 - atan(x);
}
ll LSB(ll n) { return (n & (-n)); }
template<typename T>
inline T chmin(T& a, const T& b) {
if (a > b)a = b;
return a;
}
template<typename T>
inline T chmax(T& a, const T& b) {
if (a < b)a = b;
return a;
}
//atcoder library
//#include <atcoder/all>
//using namespace atcoder;
/*-----------------------------------------ここからコード-----------------------------------------*/
/*
* @title binary-indexed-tree
* @docs kyopro/docs/BIT.md
*/
template<typename T>
//0-indexed/内部的に 1-indexed
struct BIT {
vector<T> tree;
//初期化
BIT(int n) : tree(n) {
tree.assign(n + 1, 0);
}
int LSB(int n) { return (n & (-n)); }
//[0, n) の sum を返す/0-indexed
T sum(int n) {
T ret = 0;
//実は 1-indexed だが半開区間なので見た目がそのまま
for (; n >= 0; n -= LSB(n)) {
ret += tree[n];
if (!n)break;
}
return ret;
}
//[i, j) の sum を返す/0-indexed
T sum(int i, int j) {
return sum(j) - sum(i);
}
//n 番目に x を足す
void add(int n, T x) {
int siz = tree.size();
for (++n; n < siz; n += LSB(n))tree[n] += x;
}
};
int main() {
int n;
scanf("%d", &n);
vector<int> a(n), b(n), c;
rep(i, n)scanf("%d", &a[i]);
rep(i, n)scanf("%d", &b[i]);
rep(i, n)c.push_back(a[i]);
rep(i, n)c.push_back(b[i]);
sort(all(c));
c.erase(unique(all(c)), c.end());
ll ans = 0;
sort(all(a));
rep(i, n)a[i] = distance(c.begin(), lower_bound(all(c), a[i]));
rep(i, n)b[i] = distance(c.begin(), lower_bound(all(c), b[i]));
BIT<ll> bit(n * 2);
rep(i, n) {
bit.add(b[i], 1);
ans += bit.sum(a[i]);
}
printf("%lld\n", ans);
Please AC;
}