oj.uz

Submission #1015574

# Submission time Handle Problem Language Result Execution time Memory
1015574 2024-07-06T14:26:24 Z andrei_iorgulescu Fortune Telling 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 7436 KB 
#include <bits/stdc++.h>

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 = 35;
    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:42:17: warning: unused variable 'x0' [-Wunused-variable]
   42 |             int x0 = vls[i];
      |                 ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6652 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 3 ms 6648 KB Output is correct
9 Correct 3 ms 6492 KB Output is correct
10 Correct 3 ms 6648 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 5 ms 6492 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6652 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 3 ms 6648 KB Output is correct
9 Correct 3 ms 6492 KB Output is correct
10 Correct 3 ms 6648 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 5 ms 6492 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 72 ms 6700 KB Output is correct
15 Correct 221 ms 6924 KB Output is correct
16 Correct 502 ms 7252 KB Output is correct
17 Correct 834 ms 7004 KB Output is correct
18 Correct 817 ms 7096 KB Output is correct
19 Correct 784 ms 7000 KB Output is correct
20 Correct 849 ms 7000 KB Output is correct
21 Correct 684 ms 7096 KB Output is correct
22 Correct 229 ms 7000 KB Output is correct
23 Correct 233 ms 7004 KB Output is correct
24 Correct 246 ms 7004 KB Output is correct
25 Correct 248 ms 7004 KB Output is correct
26 Correct 594 ms 7004 KB Output is correct
27 Correct 720 ms 7096 KB Output is correct
28 Correct 684 ms 7100 KB Output is correct
29 Correct 722 ms 7096 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6652 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 3 ms 6648 KB Output is correct
9 Correct 3 ms 6492 KB Output is correct
10 Correct 3 ms 6648 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 5 ms 6492 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 72 ms 6700 KB Output is correct
15 Correct 221 ms 6924 KB Output is correct
16 Correct 502 ms 7252 KB Output is correct
17 Correct 834 ms 7004 KB Output is correct
18 Correct 817 ms 7096 KB Output is correct
19 Correct 784 ms 7000 KB Output is correct
20 Correct 849 ms 7000 KB Output is correct
21 Correct 684 ms 7096 KB Output is correct
22 Correct 229 ms 7000 KB Output is correct
23 Correct 233 ms 7004 KB Output is correct
24 Correct 246 ms 7004 KB Output is correct
25 Correct 248 ms 7004 KB Output is correct
26 Correct 594 ms 7004 KB Output is correct
27 Correct 720 ms 7096 KB Output is correct
28 Correct 684 ms 7100 KB Output is correct
29 Correct 722 ms 7096 KB Output is correct
30 Correct 1229 ms 7200 KB Output is correct
31 Execution timed out 3069 ms 7436 KB Time limit exceeded
32 Halted 0 ms 0 KB -