Submission #847244
Source Code Expand
Copy
#include <iostream> #include <vector> #include <cmath> #include <ctime> #include <cassert> #include <cstdio> #include <queue> #include <set> #include <map> #include <fstream> #include <cstdlib> #include <string> #include <cstring> #include <algorithm> #include <numeric> #define mp make_pair #define mt make_tuple #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define forn(i, n) for (int i = 0; i < (int)(n); ++i) #define for1(i, n) for (int i = 1; i <= (int)(n); ++i) #define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i) #define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i) using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpi; typedef vector<vi> vvi; typedef long long i64; typedef vector<i64> vi64; typedef vector<vi64> vvi64; template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } const int maxn = 110000; i64 ps[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.precision(10); cout << fixed; #ifdef LOCAL_DEFINE freopen("input.txt", "rt", stdin); #endif int n, q; cin >> n >> q; vi64 st; st.pb(n); forn(i, q) { i64 x; cin >> x; while (!st.empty() && st.back() > x) st.pop_back(); st.pb(x); } int K = st.size(); vi64 muls(K); muls[K - 1] = 1; ford(i, K) { if (!i) { ps[st[i]] += muls[i]; break; } i64 t = muls[i]; // muls[i] += t * (st[i + 1] / st[i]); i64 z = st[i]; st[i] = 2e18; while (z > st[0]) { int i = lower_bound(all(st), z) - st.begin() - 1; muls[i] += t * (z / st[i]); z %= st[i]; } ps[z] += t; } ford(i, n) ps[i] += ps[i + 1]; for1(i, n) cout << ps[i] << '\n'; #ifdef LOCAL_DEFINE cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | endagorion |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 2206 Byte |
Status | AC |
Exec Time | 135 ms |
Memory | 4212 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1400 / 1400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 58 ms | 2304 KB |
02.txt | AC | 55 ms | 2432 KB |
03.txt | AC | 56 ms | 2432 KB |
04.txt | AC | 59 ms | 2432 KB |
05.txt | AC | 55 ms | 2432 KB |
06.txt | AC | 86 ms | 4084 KB |
07.txt | AC | 95 ms | 4212 KB |
08.txt | AC | 92 ms | 4212 KB |
09.txt | AC | 101 ms | 4084 KB |
10.txt | AC | 87 ms | 4084 KB |
11.txt | AC | 87 ms | 4212 KB |
12.txt | AC | 95 ms | 4084 KB |
13.txt | AC | 99 ms | 4212 KB |
14.txt | AC | 91 ms | 4084 KB |
15.txt | AC | 87 ms | 4084 KB |
16.txt | AC | 92 ms | 4084 KB |
17.txt | AC | 91 ms | 4212 KB |
18.txt | AC | 87 ms | 4084 KB |
19.txt | AC | 84 ms | 4084 KB |
20.txt | AC | 95 ms | 4212 KB |
21.txt | AC | 135 ms | 2932 KB |
22.txt | AC | 83 ms | 3828 KB |
23.txt | AC | 111 ms | 4084 KB |
24.txt | AC | 65 ms | 4084 KB |
25.txt | AC | 63 ms | 3956 KB |
26.txt | AC | 55 ms | 2932 KB |
27.txt | AC | 31 ms | 1280 KB |
28.txt | AC | 36 ms | 2932 KB |
29.txt | AC | 37 ms | 2932 KB |
30.txt | AC | 47 ms | 2932 KB |
31.txt | AC | 4 ms | 256 KB |
32.txt | AC | 17 ms | 1280 KB |
33.txt | AC | 4 ms | 256 KB |
34.txt | AC | 27 ms | 2560 KB |
35.txt | AC | 4 ms | 256 KB |
36.txt | AC | 4 ms | 256 KB |
s1.txt | AC | 4 ms | 256 KB |
s2.txt | AC | 4 ms | 256 KB |