oj.uz

답안 #1041059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041059 2024-08-01T14:31:26 Z sugartheanh 운세 보기 2 (JOI14_fortune_telling2) C++14
100 / 100
 294 ms 72468 KB 
/*Code by TMQ*/
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define task "1"
#define ii pair<ll, ll >
#define fi first
#define se second
#define pb push_back
#define em emplace
#define all(x) (x).begin(), (x).end()
#define sall(x) sort(all(x))
#define rall(x) reverse(all(x))
#define reset(a, x) (memset(a, x, sizeof(a)));
#define testcase ll tc; cin >> tc; while(tc--) solve();
ll inline gcd(ll a, ll b) { return !b ? abs(a) : gcd(b, a % b); }
ll inline lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
///============================================================================
#define BIT(i,mask) ((mask >> (i-1)) & 1)
#define DAOBIT(i,mask) ((mask ^ (1<<i-1))) 
#define OFFBIT(i,mask) ((mask & ~(1 << (i - 1))))
#define ONBIT(i,mask) ((mask | (1 << (i - 1)))) 
///============================================================================
const ll  mod = 1000000007;
const ll mod1 = 998244353;
const ll inf = 1000000000000000000 + 10;
const ll nmax = 200002;
///============================================================================
using namespace std;
///============================================================================
ll a[nmax], b[nmax], query[nmax];
ll n, k;
ll res;
vector<ll> t[nmax * 4];
vector<ll> operator +(vector<ll>& a, vector<ll>& b)
{
    vector<ll> ans;
    ll i, j;
    i = j = 0;
    while (i < a.size() && j < b.size())
    {
        if (a[i] < b[j])
            ans.pb(a[i++]);
        else ans.pb(b[j++]);
    }
    for (; i < a.size(); ++i)
        ans.pb(a[i]);
    for (; j < b.size(); ++j)
        ans.pb(b[j]);
    return ans;
}
void build(ll l, ll r, ll k = 1)
{
    if (l == r)
    {
        t[k].pb(query[l]);
        return;
    }
    ll mid = (l + r) >> 1;
    build(l, mid, k << 1);
    build(mid + 1, r, k << 1 | 1);
    t[k] = t[k << 1] + t[k << 1 | 1];
}
ii get(ll l, ll r, ll x, ll y, ll k = 1)
{
    auto it = lower_bound(all(t[k]), x);
    if (it == t[k].end())
        return{ 0, 0 };
    if (*it >= y)
        return { 0, t[k].end() - it };
    ll mid = (l + r) >> 1;
    if (l == r)
    {
        ///if (*it >= x && *it <= y)
        return { 1, 0 };
    }

    ii get2 = get(mid + 1, r, x, y, k * 2 + 1);
    if (get2.fi)
        return get2;
    ii get1 = get(l, mid, x, y, k * 2);
    return { get1.fi + get2.fi, get1.se + get2.se };
}
///============================================================================
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ///freopen(task".inp", "r", stdin);
    ///freopen(task".outt", "w", stdout);
    cin >> n >> k;
    for (ll i = 1; i <= n; i++)
        cin >> a[i] >> b[i];
    for (ll i = 1; i <= k; i++)
        cin >> query[i];
    build(1, k);
    // for (auto x : t[1])
    //     cout << x << ' ';
    for (ll i = 1; i <= n; i++)
    {
        ii ans = get(1, k, min(a[i], b[i]), max(a[i], b[i]));
        if (ans.fi > 0 && a[i] < b[i])
            swap(a[i], b[i]);
        if (ans.se % 2 == 0)
            res += a[i];
        else res += b[i];
    }
    cout << res;
    return 0;

}

Compilation message

fortune_telling2.cpp: In function 'std::vector<long long int> operator+(std::vector<long long int>&, std::vector<long long int>&)':
fortune_telling2.cpp:41:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     while (i < a.size() && j < b.size())
      |            ~~^~~~~~~~~~
fortune_telling2.cpp:41:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     while (i < a.size() && j < b.size())
      |                            ~~^~~~~~~~~~
fortune_telling2.cpp:47:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (; i < a.size(); ++i)
      |            ~~^~~~~~~~~~
fortune_telling2.cpp:49:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (; j < b.size(); ++j)
      |            ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23128 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23188 KB Output is correct
8 Correct 4 ms 23388 KB Output is correct
9 Correct 4 ms 23228 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 4 ms 23388 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23128 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23188 KB Output is correct
8 Correct 4 ms 23388 KB Output is correct
9 Correct 4 ms 23228 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 4 ms 23388 KB Output is correct
14 Correct 12 ms 25560 KB Output is correct
15 Correct 22 ms 28120 KB Output is correct
16 Correct 34 ms 29264 KB Output is correct
17 Correct 47 ms 33240 KB Output is correct
18 Correct 47 ms 33236 KB Output is correct
19 Correct 44 ms 33240 KB Output is correct
20 Correct 49 ms 33296 KB Output is correct
21 Correct 44 ms 33240 KB Output is correct
22 Correct 28 ms 32720 KB Output is correct
23 Correct 27 ms 32716 KB Output is correct
24 Correct 27 ms 32728 KB Output is correct
25 Correct 26 ms 32728 KB Output is correct
26 Correct 27 ms 33200 KB Output is correct
27 Correct 35 ms 33196 KB Output is correct
28 Correct 28 ms 33240 KB Output is correct
29 Correct 43 ms 33176 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23128 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23188 KB Output is correct
8 Correct 4 ms 23388 KB Output is correct
9 Correct 4 ms 23228 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 4 ms 23388 KB Output is correct
14 Correct 12 ms 25560 KB Output is correct
15 Correct 22 ms 28120 KB Output is correct
16 Correct 34 ms 29264 KB Output is correct
17 Correct 47 ms 33240 KB Output is correct
18 Correct 47 ms 33236 KB Output is correct
19 Correct 44 ms 33240 KB Output is correct
20 Correct 49 ms 33296 KB Output is correct
21 Correct 44 ms 33240 KB Output is correct
22 Correct 28 ms 32720 KB Output is correct
23 Correct 27 ms 32716 KB Output is correct
24 Correct 27 ms 32728 KB Output is correct
25 Correct 26 ms 32728 KB Output is correct
26 Correct 27 ms 33200 KB Output is correct
27 Correct 35 ms 33196 KB Output is correct
28 Correct 28 ms 33240 KB Output is correct
29 Correct 43 ms 33176 KB Output is correct
30 Correct 91 ms 69060 KB Output is correct
31 Correct 130 ms 69572 KB Output is correct
32 Correct 185 ms 70604 KB Output is correct
33 Correct 294 ms 72388 KB Output is correct
34 Correct 86 ms 68944 KB Output is correct
35 Correct 285 ms 72440 KB Output is correct
36 Correct 285 ms 72376 KB Output is correct
37 Correct 285 ms 72404 KB Output is correct
38 Correct 266 ms 72468 KB Output is correct
39 Correct 293 ms 72388 KB Output is correct
40 Correct 193 ms 72460 KB Output is correct
41 Correct 286 ms 72448 KB Output is correct
42 Correct 294 ms 72392 KB Output is correct
43 Correct 125 ms 72064 KB Output is correct
44 Correct 122 ms 72252 KB Output is correct
45 Correct 131 ms 71816 KB Output is correct
46 Correct 131 ms 71092 KB Output is correct
47 Correct 139 ms 70860 KB Output is correct
48 Correct 148 ms 72388 KB Output is correct
49 Correct 145 ms 72348 KB Output is correct