Submission #1407807
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define rep(i, n) for (int i = 0; i < (n); i ++) static const int MOD = 1000000007; #define int long long signed main() { int n; cin >> n; vector<int> d(n); rep(i, n) cin >> d[i]; sort(d.begin(), d.end()); vector<int> x(n, 0); rep(i, n) { auto it = lower_bound(d.begin(), d.end(), 2 * d[i]); x[i] = d.end() - it; //cout << x[i] << endl; } for (int i = x.size() - 1; i > 0; i --) { x[i - 1] += x[i] % MOD; } //rep(i, n) cerr << x[i] << ' '; //cerr<< endl; vector<int> y(n, 0); rep(i, n) { auto it = lower_bound(d.begin(), d.end(), 2 * d[i]); int p = it - d.begin(); //cerr << "(" << d[i] << ", " << p << ")" << endl; if (p == n) y[i] = 0; else y[i] = x[p]; //cerr << y[i] << endl; } for (int i = y.size() - 1; i > 0; i --) y[i - 1] += y[i] % MOD; //rep(i, n) cerr << y[i] << endl; //cerr << endl; long long ans = 0; rep(i, n) { auto it = lower_bound(d.begin(), d.end(), 2 * d[i]); int p = it - d.begin(); // << "p = " << p << endl; if (p == n) continue; ans += y[p] % MOD; } cout << ans % MOD << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 難易度 |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1549 Byte |
Status | AC |
Exec Time | 49 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 2 ms | 256 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 2 ms | 256 KB |
subtask1_08.txt | AC | 2 ms | 256 KB |
subtask1_09.txt | AC | 2 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 2 ms | 256 KB |
subtask1_12.txt | AC | 2 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 256 KB |
subtask1_14.txt | AC | 2 ms | 256 KB |
subtask1_15.txt | AC | 2 ms | 256 KB |
subtask1_16.txt | AC | 2 ms | 256 KB |
subtask1_17.txt | AC | 2 ms | 256 KB |
subtask1_18.txt | AC | 2 ms | 256 KB |
subtask1_19.txt | AC | 2 ms | 256 KB |
subtask2_01.txt | AC | 15 ms | 1024 KB |
subtask2_02.txt | AC | 13 ms | 896 KB |
subtask2_03.txt | AC | 7 ms | 512 KB |
subtask2_04.txt | AC | 8 ms | 640 KB |
subtask2_05.txt | AC | 39 ms | 2048 KB |
subtask2_06.txt | AC | 34 ms | 1920 KB |
subtask2_07.txt | AC | 3 ms | 384 KB |
subtask2_08.txt | AC | 3 ms | 384 KB |
subtask2_09.txt | AC | 41 ms | 2176 KB |
subtask2_10.txt | AC | 25 ms | 1408 KB |
subtask2_11.txt | AC | 3 ms | 384 KB |
subtask2_12.txt | AC | 23 ms | 1280 KB |
subtask2_13.txt | AC | 4 ms | 384 KB |
subtask2_14.txt | AC | 30 ms | 1664 KB |
subtask2_15.txt | AC | 49 ms | 2560 KB |
subtask2_16.txt | AC | 49 ms | 2560 KB |
subtask2_17.txt | AC | 49 ms | 2560 KB |
subtask2_18.txt | AC | 49 ms | 2560 KB |
subtask2_19.txt | AC | 49 ms | 2560 KB |
subtask2_20.txt | AC | 29 ms | 2560 KB |
subtask2_21.txt | AC | 30 ms | 2560 KB |