This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
int n,k,a[200005],b[200005],t[200005];
int g;
bool tr[105][105];
vector<int> lol;
int pa[200005],pb[200005];
pair<int,int> vv[400005];
bool sp[200005];
int f1[400005],f2[400005];
int vls[105],pvls;
int opp[105],nrop;
void solve(vector<int> op)
{
nrop = 0;
for (auto it : op)
opp[nrop++] = it;
set<int> ss;
for (auto it : op)
ss.insert(it);
pvls = 0;
for (auto it : ss)
vls[pvls++] = it;
vls[pvls++] = (int)2e9;
int i0 = 0;
for (int i = 1; i <= 2 * n; i++)
{
while (vls[i0] < f1[i])
i0++;
if (f2[i] < 0)
pb[-f2[i]] = i0;
else
pa[f2[i]] = i0;
}
for (int i = 0; i < pvls; i++)
{
for (int j = 0; j < pvls; j++)
{
int x0 = vls[i];
int x = vls[i],y = vls[j];
bool cnt_swap = false;
for (int q = 0; q < nrop; q++)
{
if (opp[q] >= x)
swap(x,y),cnt_swap ^= 1;
}
if (cnt_swap)
tr[i][j] = true;
else
tr[i][j] = false;
}
}
for (int i = 1; i <= n; i++)
{
if ((!sp[i] and tr[pa[i]][pb[i]]) or (sp[i] and tr[pb[i]][pa[i]]))
swap(a[i],b[i]),sp[i] ^= 1;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= k; i++)
cin >> t[i];
for (int i = 1; i <= n; i++)
{
vv[2 * i - 1] = {a[i],i};
vv[2 * i] = {b[i],-i};
}
sort(vv + 1,vv + 2 * n + 1);
for (int i = 1; i <= 2 * n; i++)
{
f1[i] = vv[i].first;
f2[i] = vv[i].second;
}
g = 90;
for (int i = 1; i <= k; i += g)
{
vector<int> op;
for (int j = i; j <= k and j < i + g; j++)
op.push_back(t[j]);
solve(op);
}
long long ans = 0;
for (int i = 1; i <= n; i++)
ans += a[i];
cout << ans;
return 0;
}
Compilation message (stderr)
fortune_telling2.cpp: In function 'void solve(std::vector<int>)':
fortune_telling2.cpp:45:17: warning: unused variable 'x0' [-Wunused-variable]
45 | int x0 = vls[i];
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |