oj.uz

답안 #1015561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015561 2024-07-06T14:07:23 Z andrei_iorgulescu 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 8820 KB 
#include <bits/stdc++.h>

using namespace std;

int n,k,a[200005],b[200005],t[200005];
int g;
bool tr[1005][1005];
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;
    }
    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 = 200;
    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:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < vls.size(); i++)
      |                     ~~^~~~~~~~~~~~
fortune_telling2.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int j = 0; j < vls.size(); j++)
      |                         ~~^~~~~~~~~~~~
fortune_telling2.cpp:36:17: warning: unused variable 'x0' [-Wunused-variable]
   36 |             int x0 = vls[i];
      |                 ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 38 ms 8540 KB Output is correct
3 Correct 31 ms 8540 KB Output is correct
4 Correct 34 ms 8540 KB Output is correct
5 Correct 29 ms 8536 KB Output is correct
6 Correct 30 ms 8540 KB Output is correct
7 Correct 30 ms 8684 KB Output is correct
8 Correct 31 ms 8540 KB Output is correct
9 Correct 30 ms 8540 KB Output is correct
10 Correct 25 ms 8540 KB Output is correct
11 Correct 26 ms 8536 KB Output is correct
12 Correct 30 ms 8540 KB Output is correct
13 Correct 30 ms 8540 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 38 ms 8540 KB Output is correct
3 Correct 31 ms 8540 KB Output is correct
4 Correct 34 ms 8540 KB Output is correct
5 Correct 29 ms 8536 KB Output is correct
6 Correct 30 ms 8540 KB Output is correct
7 Correct 30 ms 8684 KB Output is correct
8 Correct 31 ms 8540 KB Output is correct
9 Correct 30 ms 8540 KB Output is correct
10 Correct 25 ms 8540 KB Output is correct
11 Correct 26 ms 8536 KB Output is correct
12 Correct 30 ms 8540 KB Output is correct
13 Correct 30 ms 8540 KB Output is correct
14 Correct 281 ms 8536 KB Output is correct
15 Correct 576 ms 8540 KB Output is correct
16 Correct 910 ms 8540 KB Output is correct
17 Correct 1262 ms 8816 KB Output is correct
18 Correct 1286 ms 8812 KB Output is correct
19 Correct 1322 ms 8816 KB Output is correct
20 Correct 1222 ms 8788 KB Output is correct
21 Correct 1253 ms 8816 KB Output is correct
22 Correct 1135 ms 8816 KB Output is correct
23 Correct 1130 ms 8796 KB Output is correct
24 Correct 1147 ms 8816 KB Output is correct
25 Correct 1121 ms 8792 KB Output is correct
26 Correct 1224 ms 8796 KB Output is correct
27 Correct 1275 ms 8812 KB Output is correct
28 Correct 1297 ms 8784 KB Output is correct
29 Correct 1256 ms 8820 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 38 ms 8540 KB Output is correct
3 Correct 31 ms 8540 KB Output is correct
4 Correct 34 ms 8540 KB Output is correct
5 Correct 29 ms 8536 KB Output is correct
6 Correct 30 ms 8540 KB Output is correct
7 Correct 30 ms 8684 KB Output is correct
8 Correct 31 ms 8540 KB Output is correct
9 Correct 30 ms 8540 KB Output is correct
10 Correct 25 ms 8540 KB Output is correct
11 Correct 26 ms 8536 KB Output is correct
12 Correct 30 ms 8540 KB Output is correct
13 Correct 30 ms 8540 KB Output is correct
14 Correct 281 ms 8536 KB Output is correct
15 Correct 576 ms 8540 KB Output is correct
16 Correct 910 ms 8540 KB Output is correct
17 Correct 1262 ms 8816 KB Output is correct
18 Correct 1286 ms 8812 KB Output is correct
19 Correct 1322 ms 8816 KB Output is correct
20 Correct 1222 ms 8788 KB Output is correct
21 Correct 1253 ms 8816 KB Output is correct
22 Correct 1135 ms 8816 KB Output is correct
23 Correct 1130 ms 8796 KB Output is correct
24 Correct 1147 ms 8816 KB Output is correct
25 Correct 1121 ms 8792 KB Output is correct
26 Correct 1224 ms 8796 KB Output is correct
27 Correct 1275 ms 8812 KB Output is correct
28 Correct 1297 ms 8784 KB Output is correct
29 Correct 1256 ms 8820 KB Output is correct
30 Execution timed out 3065 ms 8540 KB Time limit exceeded
31 Halted 0 ms 0 KB -