oj.uz

Submission #1015590

# Submission time Handle Problem Language Result Execution time Memory
1015590 2024-07-06T14:40:31 Z andrei_iorgulescu Fortune Telling 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 10840 KB 
#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[305][305];
vector<int> lol;
int pa[200005],pb[200005];
pair<int,int> vv[400005];
bool sp[200005];
int f1[400005],f2[400005];
int vls[305],pvls;
int opp[305],nrop;
bool incerc[305][305];

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)
        {
            if (!sp[-f2[i]])
                pb[-f2[i]] = i0;
            else
                pa[-f2[i]] = i0;
        }
        else
        {
            if (!sp[f2[i]])
                pa[f2[i]] = i0;
            else
                pb[f2[i]] = i0;
        }
    }
    for (int i = 0; i < pvls; i++)
        for (int j = 0; j < pvls; j++)
            incerc[i][j] = false;
    for (int i = 1; i <= n; i++)
        incerc[pa[i]][pb[i]] = true;
    for (int i = 0; i < pvls; i++)
    {
        for (int j = 0; j < pvls; j++)
        {
            if (!incerc[i][j])
                continue;
            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 (tr[pa[i]][pb[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 = 300;
    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

fortune_telling2.cpp: In function 'void solve(std::vector<int>)':
fortune_telling2.cpp:63:17: warning: unused variable 'x0' [-Wunused-variable]
   63 |             int x0 = vls[i];
      |                 ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8792 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8668 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8664 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8792 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8668 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8664 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 56 ms 8792 KB Output is correct
15 Correct 175 ms 8836 KB Output is correct
16 Correct 331 ms 8796 KB Output is correct
17 Correct 544 ms 9044 KB Output is correct
18 Correct 539 ms 8832 KB Output is correct
19 Correct 274 ms 8796 KB Output is correct
20 Correct 295 ms 8836 KB Output is correct
21 Correct 129 ms 8836 KB Output is correct
22 Correct 56 ms 8796 KB Output is correct
23 Correct 59 ms 8796 KB Output is correct
24 Correct 62 ms 8796 KB Output is correct
25 Correct 53 ms 8796 KB Output is correct
26 Correct 98 ms 8796 KB Output is correct
27 Correct 123 ms 8836 KB Output is correct
28 Correct 108 ms 8796 KB Output is correct
29 Correct 142 ms 8796 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8792 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8668 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8664 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 56 ms 8792 KB Output is correct
15 Correct 175 ms 8836 KB Output is correct
16 Correct 331 ms 8796 KB Output is correct
17 Correct 544 ms 9044 KB Output is correct
18 Correct 539 ms 8832 KB Output is correct
19 Correct 274 ms 8796 KB Output is correct
20 Correct 295 ms 8836 KB Output is correct
21 Correct 129 ms 8836 KB Output is correct
22 Correct 56 ms 8796 KB Output is correct
23 Correct 59 ms 8796 KB Output is correct
24 Correct 62 ms 8796 KB Output is correct
25 Correct 53 ms 8796 KB Output is correct
26 Correct 98 ms 8796 KB Output is correct
27 Correct 123 ms 8836 KB Output is correct
28 Correct 108 ms 8796 KB Output is correct
29 Correct 142 ms 8796 KB Output is correct
30 Correct 1100 ms 8840 KB Output is correct
31 Correct 2858 ms 8836 KB Output is correct
32 Execution timed out 3044 ms 10840 KB Time limit exceeded
33 Halted 0 ms 0 KB -