Submission #2019574
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>
using namespace std;
typedef pair<int, int> Pi;
typedef long long ll;
#define pii Pi
#define pll PL
#define Fi first
#define Se second
#define pb(x) push_back(x)
//#define sz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> pll;
typedef long double ldouble;
typedef pair<double, double> pdd;
const double PI = acos(-1);
const double EPS = 1e-9;
const int MX = 1<<20;
const int MM = 1000000007;
struct Tree{
struct node{
pii v;
int add;
};
node t[MX*2];
void update(int l, int r, int v, int n = 1, int s = 0, int e = MX-1){
if( r < s || e < l ) return;
else if( l <= s && e <= r ){
t[n].v.first += v;
t[n].add += v;
}
else{
int m = (s+e) / 2;
update(l, r, v, n*2, s, m);
update(l, r, v, n*2+1, m+1, e);
t[n].v = min(t[n*2].v, t[n*2+1].v);
t[n].v.first += t[n].add;
}
}
pii read(int l, int r, int n = 1, int s = 0, int e = MX-1){
if( r < s || e < l ) return pii(1e9, -1);
else if( l <= s && e <= r ) return t[n].v;
else{
int m = (s+e) / 2;
pii res = min(read(l, r, n*2, s, m), read(l, r, n*2+1, m+1, e));
res.first += t[n].add;
return res;
}
}
} tree;
int A[MX];
int main()
{
int N;
vector<int> X;
scanf("%d", &N);
for(int i = 1; i <= N; i++) scanf("%d", A+i), X.push_back(A[i]);
sort(X.begin(), X.end());
X.erase(unique(X.begin(), X.end()), X.end());
for(int i = 0; i < X.size(); i++) tree.t[i+MX].v = pii(X[i], i);
for(int i = MX-1; i >= 1; i--) tree.t[i].v = min(tree.t[i*2].v, tree.t[i*2+1].v);
ll ans = 0;
for(int i = 1; i <= N; i++){
int v = A[i], w = lower_bound(X.begin(), X.end(), A[i]) - X.begin();
pii t = tree.read(w, X.size()-1);
ans += t.first - v;
tree.update(0, t.second-1, 1);
}
printf("%lld\n", ans);
}
Submission Info
Submission Time
2018-01-27 06:25:31+0900
Task
B - Increment and Swap
User
zigui
Language
C++14 (GCC 5.4.1)
Score
1500
Code Size
2236 Byte
Status
AC
Exec Time
175 ms
Memory
26488 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:79:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
./Main.cpp:80:65: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= N; i++) scanf("%d", A+i), X.push_back(A[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1500 / 1500
Status
Set Name
Test Cases
Sample
example0.txt, example1.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, example0.txt, example1.txt
Case Name
Status
Exec Time
Memory
000.txt
AC
160 ms
26488 KB
001.txt
AC
157 ms
26488 KB
002.txt
AC
163 ms
26488 KB
003.txt
AC
164 ms
26488 KB
004.txt
AC
164 ms
26488 KB
005.txt
AC
165 ms
26488 KB
006.txt
AC
166 ms
26488 KB
007.txt
AC
169 ms
26488 KB
008.txt
AC
168 ms
26488 KB
009.txt
AC
172 ms
26488 KB
010.txt
AC
162 ms
26488 KB
011.txt
AC
174 ms
26488 KB
012.txt
AC
173 ms
26488 KB
013.txt
AC
173 ms
26488 KB
014.txt
AC
173 ms
26488 KB
015.txt
AC
174 ms
26488 KB
016.txt
AC
172 ms
26488 KB
017.txt
AC
172 ms
26488 KB
018.txt
AC
159 ms
26488 KB
019.txt
AC
165 ms
26488 KB
020.txt
AC
172 ms
26488 KB
021.txt
AC
25 ms
25216 KB
022.txt
AC
153 ms
26488 KB
023.txt
AC
79 ms
25724 KB
024.txt
AC
37 ms
25344 KB
025.txt
AC
98 ms
25976 KB
026.txt
AC
28 ms
25216 KB
027.txt
AC
128 ms
26488 KB
028.txt
AC
70 ms
25724 KB
029.txt
AC
66 ms
25724 KB
030.txt
AC
70 ms
25724 KB
031.txt
AC
131 ms
26488 KB
032.txt
AC
88 ms
25724 KB
033.txt
AC
85 ms
25724 KB
034.txt
AC
140 ms
26488 KB
035.txt
AC
33 ms
25216 KB
036.txt
AC
157 ms
26488 KB
037.txt
AC
122 ms
26488 KB
038.txt
AC
41 ms
25344 KB
039.txt
AC
91 ms
25848 KB
040.txt
AC
86 ms
25724 KB
041.txt
AC
153 ms
26488 KB
042.txt
AC
117 ms
26488 KB
043.txt
AC
116 ms
26488 KB
044.txt
AC
168 ms
26488 KB
045.txt
AC
10 ms
24832 KB
046.txt
AC
96 ms
26488 KB
047.txt
AC
171 ms
26488 KB
048.txt
AC
81 ms
26488 KB
049.txt
AC
101 ms
26488 KB
050.txt
AC
105 ms
26488 KB
051.txt
AC
107 ms
26488 KB
052.txt
AC
128 ms
26488 KB
053.txt
AC
141 ms
26488 KB
054.txt
AC
175 ms
26488 KB
055.txt
AC
77 ms
26488 KB
056.txt
AC
98 ms
26488 KB
057.txt
AC
99 ms
26488 KB
058.txt
AC
104 ms
26488 KB
059.txt
AC
122 ms
26488 KB
060.txt
AC
142 ms
26488 KB
061.txt
AC
169 ms
26488 KB
062.txt
AC
124 ms
26488 KB
063.txt
AC
113 ms
26488 KB
example0.txt
AC
10 ms
24832 KB
example1.txt
AC
10 ms
24832 KB