Submission #1692590
Source Code Expand
#include <iostream> #include <vector> #include <queue> using namespace std; typedef long long ll; typedef unsigned long long ull; constexpr int TEN(int n) { return (n==0)?1:10*TEN(n-1); } struct Node { using NP = Node*; int ma = -1; int get(int a, int b) { if (b <= 0 or sz <= a) return -1; if (a <= 0 and sz <= b) return ma; return max(l->get(a, b), r->get(a-sz/2, b-sz/2)); } void set(int k, int x) { if (sz == 1) { ma = x; return; } if (k < sz/2) l->set(k, x); else r->set(k-sz/2, x); ma = max(l->ma, r->ma); } NP l, r; int sz; Node(int sz) : sz(sz) { if (sz == 1) return; l = new Node(sz/2); r = new Node(sz - sz/2); } }; int main() { int n, k; scanf("%d %d", &n, &k); int p[n], q[n]; for (int i = 0; i < n; i++) { scanf("%d", p+i); p[i]--; } for (int i = 0; i < n; i++) q[p[i]] = i; Node* rmq = new Node(n); int mi[n]; vector<vector<int>> g(n); for (int i = 0; i < n; i++) { { int v = rmq->get(max(0, q[i]-k+1), q[i]); if (v != -1) { int qv = q[v]; g[q[i]].push_back(qv); } } { int v = rmq->get(q[i], min(n, q[i]+k)); if (v != -1) { int qv = q[v]; g[q[i]].push_back(qv); } rmq->set(q[i], i); } rmq->set(q[i], i); } int deg[n]; fill_n(deg, n, 0); for (int i = 0; i < n; i++) for (int j: g[i]) deg[j]++; priority_queue<int> que; for (int i = 0; i < n; i++) if (deg[i] == 0) que.push(i); vector<int> v; while (que.size()) { int p = que.top(); que.pop(); v.push_back(p); for (int d: g[p]) { deg[d]--; if (deg[d] == 0) que.push(d); } } reverse(v.begin(), v.end()); int ans[n]; for (int i = 0; i < n; i++) ans[v[i]] = i+1; for (int i = 0; i < n; i++) printf("%d\n", ans[i]); }
Submission Info
Submission Time | |
---|---|
Task | F - Wide Swap |
User | c313827 |
Language | C++14 (Clang 3.8.0) |
Score | 2000 |
Code Size | 1860 Byte |
Status | AC |
Exec Time | 1346 ms |
Memory | 87672 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 2000 / 2000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, 050.txt, 051.txt, 052.txt, 053.txt, 054.txt, 055.txt, 056.txt, 057.txt, 058.txt, 059.txt, 060.txt, 061.txt, 062.txt, 063.txt, 064.txt, 065.txt, 066.txt, 067.txt, 068.txt, 069.txt, 070.txt, 071.txt, 072.txt, 073.txt, 074.txt, 075.txt, 076.txt, 077.txt, 078.txt, 079.txt, 080.txt, 081.txt, 082.txt, 083.txt, 084.txt, 085.txt, 086.txt, 087.txt, 088.txt, 089.txt, 090.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 298 ms | 640 KB |
010.txt | AC | 3 ms | 640 KB |
011.txt | AC | 3 ms | 640 KB |
012.txt | AC | 3 ms | 640 KB |
013.txt | AC | 3 ms | 640 KB |
014.txt | AC | 3 ms | 640 KB |
015.txt | AC | 3 ms | 640 KB |
016.txt | AC | 3 ms | 640 KB |
017.txt | AC | 3 ms | 640 KB |
018.txt | AC | 3 ms | 640 KB |
019.txt | AC | 3 ms | 512 KB |
020.txt | AC | 2 ms | 384 KB |
021.txt | AC | 1 ms | 256 KB |
022.txt | AC | 3 ms | 512 KB |
023.txt | AC | 3 ms | 512 KB |
024.txt | AC | 3 ms | 512 KB |
025.txt | AC | 3 ms | 640 KB |
026.txt | AC | 3 ms | 640 KB |
027.txt | AC | 2 ms | 512 KB |
028.txt | AC | 2 ms | 384 KB |
029.txt | AC | 3 ms | 512 KB |
030.txt | AC | 3 ms | 640 KB |
031.txt | AC | 3 ms | 640 KB |
032.txt | AC | 3 ms | 640 KB |
033.txt | AC | 3 ms | 640 KB |
034.txt | AC | 3 ms | 640 KB |
035.txt | AC | 3 ms | 640 KB |
036.txt | AC | 3 ms | 640 KB |
037.txt | AC | 3 ms | 640 KB |
038.txt | AC | 3 ms | 640 KB |
039.txt | AC | 936 ms | 83184 KB |
040.txt | AC | 1224 ms | 87672 KB |
041.txt | AC | 1346 ms | 87668 KB |
042.txt | AC | 1319 ms | 87668 KB |
043.txt | AC | 1340 ms | 87668 KB |
044.txt | AC | 1088 ms | 87668 KB |
045.txt | AC | 1058 ms | 87152 KB |
046.txt | AC | 1292 ms | 87664 KB |
047.txt | AC | 1339 ms | 87668 KB |
048.txt | AC | 1107 ms | 87408 KB |
049.txt | AC | 381 ms | 37748 KB |
050.txt | AC | 640 ms | 48244 KB |
051.txt | AC | 525 ms | 42868 KB |
052.txt | AC | 1151 ms | 79216 KB |
053.txt | AC | 114 ms | 14716 KB |
054.txt | AC | 802 ms | 58224 KB |
055.txt | AC | 4 ms | 640 KB |
056.txt | AC | 92 ms | 10884 KB |
057.txt | AC | 518 ms | 43776 KB |
058.txt | AC | 111 ms | 11772 KB |
059.txt | AC | 746 ms | 73972 KB |
060.txt | AC | 935 ms | 87664 KB |
061.txt | AC | 905 ms | 83056 KB |
062.txt | AC | 930 ms | 87664 KB |
063.txt | AC | 951 ms | 84976 KB |
064.txt | AC | 932 ms | 87664 KB |
065.txt | AC | 1008 ms | 85744 KB |
066.txt | AC | 950 ms | 87664 KB |
067.txt | AC | 998 ms | 86128 KB |
068.txt | AC | 949 ms | 87664 KB |
069.txt | AC | 595 ms | 87664 KB |
070.txt | AC | 640 ms | 87664 KB |
071.txt | AC | 594 ms | 87664 KB |
072.txt | AC | 546 ms | 85360 KB |
073.txt | AC | 625 ms | 87664 KB |
074.txt | AC | 557 ms | 83188 KB |
075.txt | AC | 662 ms | 87664 KB |
076.txt | AC | 662 ms | 87664 KB |
077.txt | AC | 629 ms | 87664 KB |
078.txt | AC | 625 ms | 87664 KB |
079.txt | AC | 168 ms | 25592 KB |
080.txt | AC | 23 ms | 3968 KB |
081.txt | AC | 47 ms | 7932 KB |
082.txt | AC | 315 ms | 44144 KB |
083.txt | AC | 92 ms | 14844 KB |
084.txt | AC | 92 ms | 15868 KB |
085.txt | AC | 75 ms | 12152 KB |
086.txt | AC | 20 ms | 3840 KB |
087.txt | AC | 160 ms | 24948 KB |
088.txt | AC | 95 ms | 17400 KB |
089.txt | AC | 489 ms | 73972 KB |
090.txt | AC | 544 ms | 87664 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |