Submission #61574307
Source Code Expand
Copy
#include <bits/stdc++.h>using namespace std;#define ull unsigned long long#define int long long#define pii pair<int,int>#define N 2000000void solve() {int n;cin >> n;vector<int> a(n+9),s(N+9);auto add = [&](int x, int k) {for (; x < N; x+=x&-x) s[x]+=k;};auto query = [&](int x) {if (x == 0) return 0ll;int ans = 0;for (;x;x-=x&-x) ans+=s[x];
#include <bits/stdc++.h> using namespace std; #define ull unsigned long long #define int long long #define pii pair<int,int> #define N 2000000 void solve() { int n; cin >> n; vector<int> a(n+9),s(N+9); auto add = [&](int x, int k) { for (; x < N; x+=x&-x) s[x]+=k; }; auto query = [&](int x) { if (x == 0) return 0ll; int ans = 0; for (;x;x-=x&-x) ans+=s[x]; return ans; }; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { int ans = a[i]+query(N)-query(i-1); if (ans+i > 0 && ans+i < N) add(ans+i,1); cout << max(0ll,ans-(n-i)) << " "; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; for (int i = 0; i < t; i++) { solve(); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Coming of Age Celebration |
User | CirnoNine |
Language | C++ 23 (gcc 12.2) |
Score | 400 |
Code Size | 904 Byte |
Status | AC |
Exec Time | 91 ms |
Memory | 23412 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample00.txt, sample01.txt, sample02.txt |
All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample00.txt | AC | 7 ms | 18544 KB |
sample01.txt | AC | 7 ms | 18696 KB |
sample02.txt | AC | 7 ms | 18600 KB |
testcase00.txt | AC | 7 ms | 18620 KB |
testcase01.txt | AC | 53 ms | 22616 KB |
testcase02.txt | AC | 64 ms | 23412 KB |
testcase03.txt | AC | 76 ms | 22052 KB |
testcase04.txt | AC | 90 ms | 22736 KB |
testcase05.txt | AC | 31 ms | 19688 KB |
testcase06.txt | AC | 91 ms | 22808 KB |
testcase07.txt | AC | 75 ms | 21880 KB |
testcase08.txt | AC | 91 ms | 22732 KB |
testcase09.txt | AC | 78 ms | 22032 KB |
testcase10.txt | AC | 90 ms | 22736 KB |
testcase11.txt | AC | 43 ms | 20276 KB |
testcase12.txt | AC | 90 ms | 22732 KB |
testcase13.txt | AC | 64 ms | 21184 KB |
testcase14.txt | AC | 91 ms | 22824 KB |
testcase15.txt | AC | 18 ms | 19308 KB |
testcase16.txt | AC | 91 ms | 22740 KB |
testcase17.txt | AC | 76 ms | 22204 KB |
testcase18.txt | AC | 57 ms | 22324 KB |
testcase19.txt | AC | 49 ms | 22316 KB |