oj.uz

답안 #1015596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015596 2024-07-06T14:45:52 Z andrei_iorgulescu 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 6992 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;
short 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 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]])
            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++)
        if (sp[i])
            swap(a[i],b[i]);
    for (int i = 1; i <= n; i++)
        ans += a[i];
    cout << ans;
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 6 ms 6640 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 6 ms 6648 KB Output is correct
5 Correct 6 ms 6640 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6644 KB Output is correct
8 Correct 9 ms 6488 KB Output is correct
9 Correct 6 ms 6492 KB Output is correct
10 Correct 6 ms 6488 KB Output is correct
11 Correct 6 ms 6640 KB Output is correct
12 Correct 6 ms 6492 KB Output is correct
13 Correct 6 ms 6644 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 6 ms 6640 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 6 ms 6648 KB Output is correct
5 Correct 6 ms 6640 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6644 KB Output is correct
8 Correct 9 ms 6488 KB Output is correct
9 Correct 6 ms 6492 KB Output is correct
10 Correct 6 ms 6488 KB Output is correct
11 Correct 6 ms 6640 KB Output is correct
12 Correct 6 ms 6492 KB Output is correct
13 Correct 6 ms 6644 KB Output is correct
14 Correct 78 ms 6720 KB Output is correct
15 Correct 205 ms 6764 KB Output is correct
16 Correct 354 ms 6804 KB Output is correct
17 Correct 587 ms 6748 KB Output is correct
18 Correct 586 ms 6748 KB Output is correct
19 Correct 506 ms 6772 KB Output is correct
20 Correct 593 ms 6744 KB Output is correct
21 Correct 445 ms 6744 KB Output is correct
22 Correct 272 ms 6748 KB Output is correct
23 Correct 284 ms 6992 KB Output is correct
24 Correct 290 ms 6744 KB Output is correct
25 Correct 301 ms 6744 KB Output is correct
26 Correct 401 ms 6744 KB Output is correct
27 Correct 500 ms 6844 KB Output is correct
28 Correct 440 ms 6840 KB Output is correct
29 Correct 504 ms 6840 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 6 ms 6640 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 6 ms 6648 KB Output is correct
5 Correct 6 ms 6640 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6644 KB Output is correct
8 Correct 9 ms 6488 KB Output is correct
9 Correct 6 ms 6492 KB Output is correct
10 Correct 6 ms 6488 KB Output is correct
11 Correct 6 ms 6640 KB Output is correct
12 Correct 6 ms 6492 KB Output is correct
13 Correct 6 ms 6644 KB Output is correct
14 Correct 78 ms 6720 KB Output is correct
15 Correct 205 ms 6764 KB Output is correct
16 Correct 354 ms 6804 KB Output is correct
17 Correct 587 ms 6748 KB Output is correct
18 Correct 586 ms 6748 KB Output is correct
19 Correct 506 ms 6772 KB Output is correct
20 Correct 593 ms 6744 KB Output is correct
21 Correct 445 ms 6744 KB Output is correct
22 Correct 272 ms 6748 KB Output is correct
23 Correct 284 ms 6992 KB Output is correct
24 Correct 290 ms 6744 KB Output is correct
25 Correct 301 ms 6744 KB Output is correct
26 Correct 401 ms 6744 KB Output is correct
27 Correct 500 ms 6844 KB Output is correct
28 Correct 440 ms 6840 KB Output is correct
29 Correct 504 ms 6840 KB Output is correct
30 Correct 1503 ms 6724 KB Output is correct
31 Execution timed out 3054 ms 6740 KB Time limit exceeded
32 Halted 0 ms 0 KB -