oj.uz

답안 #1015558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015558 2024-07-06T14:05:08 Z andrei_iorgulescu 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 7020 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];
int sp[200005];

void solve(vector<int> op)
{
    set<int> ss;
    for (auto it : op)
        ss.insert(it);
    vector<int> vls;
    for (auto it : ss)
        vls.push_back(it);
    vls.push_back((int)2e9);
    int i0 = 0;
    for (int i = 1; i <= 2 * n; i++)
    {
        while (vls[i0] < vv[i].first)
            i0++;
        if (vv[i].second < 0)
            pb[-vv[i].second] = i0;
        else
            pa[vv[i].second] = i0;
    }
    lol = vls;
    for (int i = 0; i < vls.size(); i++)
    {
        for (int j = 0; j < vls.size(); j++)
        {
            int x0 = vls[i];
            int x = vls[i],y = vls[j];
            int cnt_swap = 0;
            for (auto it : op)
            {
                if (it >= 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);
    g = 100;
    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:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < vls.size(); i++)
      |                     ~~^~~~~~~~~~~~
fortune_telling2.cpp:35:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for (int j = 0; j < vls.size(); j++)
      |                         ~~^~~~~~~~~~~~
fortune_telling2.cpp:37:17: warning: unused variable 'x0' [-Wunused-variable]
   37 |             int x0 = vls[i];
      |                 ^~

Subtask #1
4.0 / 4.0

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

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6492 KB Output is correct
2 Correct 9 ms 6636 KB Output is correct
3 Correct 13 ms 6640 KB Output is correct
4 Correct 9 ms 6492 KB Output is correct
5 Correct 9 ms 6492 KB Output is correct
6 Correct 14 ms 6644 KB Output is correct
7 Correct 9 ms 6492 KB Output is correct
8 Correct 10 ms 6640 KB Output is correct
9 Correct 10 ms 6488 KB Output is correct
10 Correct 8 ms 6492 KB Output is correct
11 Correct 9 ms 6616 KB Output is correct
12 Correct 9 ms 6492 KB Output is correct
13 Correct 9 ms 6492 KB Output is correct
14 Correct 100 ms 6492 KB Output is correct
15 Correct 262 ms 6744 KB Output is correct
16 Correct 404 ms 6744 KB Output is correct
17 Correct 611 ms 7016 KB Output is correct
18 Correct 585 ms 7000 KB Output is correct
19 Correct 579 ms 7020 KB Output is correct
20 Correct 591 ms 7020 KB Output is correct
21 Correct 503 ms 7000 KB Output is correct
22 Correct 329 ms 7004 KB Output is correct
23 Correct 376 ms 6876 KB Output is correct
24 Correct 341 ms 7016 KB Output is correct
25 Correct 344 ms 7020 KB Output is correct
26 Correct 463 ms 6744 KB Output is correct
27 Correct 528 ms 7000 KB Output is correct
28 Correct 493 ms 7016 KB Output is correct
29 Correct 519 ms 7016 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6492 KB Output is correct
2 Correct 9 ms 6636 KB Output is correct
3 Correct 13 ms 6640 KB Output is correct
4 Correct 9 ms 6492 KB Output is correct
5 Correct 9 ms 6492 KB Output is correct
6 Correct 14 ms 6644 KB Output is correct
7 Correct 9 ms 6492 KB Output is correct
8 Correct 10 ms 6640 KB Output is correct
9 Correct 10 ms 6488 KB Output is correct
10 Correct 8 ms 6492 KB Output is correct
11 Correct 9 ms 6616 KB Output is correct
12 Correct 9 ms 6492 KB Output is correct
13 Correct 9 ms 6492 KB Output is correct
14 Correct 100 ms 6492 KB Output is correct
15 Correct 262 ms 6744 KB Output is correct
16 Correct 404 ms 6744 KB Output is correct
17 Correct 611 ms 7016 KB Output is correct
18 Correct 585 ms 7000 KB Output is correct
19 Correct 579 ms 7020 KB Output is correct
20 Correct 591 ms 7020 KB Output is correct
21 Correct 503 ms 7000 KB Output is correct
22 Correct 329 ms 7004 KB Output is correct
23 Correct 376 ms 6876 KB Output is correct
24 Correct 341 ms 7016 KB Output is correct
25 Correct 344 ms 7020 KB Output is correct
26 Correct 463 ms 6744 KB Output is correct
27 Correct 528 ms 7000 KB Output is correct
28 Correct 493 ms 7016 KB Output is correct
29 Correct 519 ms 7016 KB Output is correct
30 Correct 1734 ms 6488 KB Output is correct
31 Execution timed out 3006 ms 7000 KB Time limit exceeded
32 Halted 0 ms 0 KB -