oj.uz

답안 #997706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997706 2024-06-12T17:56:39 Z cpptowin Inspections (NOI23_inspections) C++17
55 / 100
 1146 ms 1048576 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 10000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e9
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n, m, q, l[maxn], r[maxn], s[maxn];
namespace sub2
{
    struct BIT
    {
        int t[maxn];
        void up(int x, int val)
        {
            for (; x; x -= lb(x))
                t[x] += val;
        }
        int get(int x)
        {
            int ans = 0;
            for (; x < maxn; x += lb(x))
                ans += t[x];
            return ans;
        }
    } t;
    vi adj[N];
    void solve()
    {
        vi v;
        fo(i, 1, m)
        {
            fo(j, l[i], r[i])
            {
                v.pb(j);
                adj[j].pb((int)v.size());
            }
        }
        fo(i, 1, q) minimize(s[i], v.size() + 5);
        fo(i, 1, n)
        {
            fo(j, 1, (int)adj[i].size() - 1)
            {
                t.up(adj[i][j] - adj[i][j - 1], 1);
            }
        }
        fo(i, 1, q) cout << t.get(s[i] + 1) << ' ';
    }
}
namespace sub4
{
    int su[maxn];
    vector<array<int, 3>> range;
    vi save;
    int p[maxn];
    void solve()
    {
        save.pb(1);
        fo(i, 1, m)
        {
            save.pb(l[i]);
            if (r[i] != n)
                save.pb(r[i] + 1);
        }
        sort(all(save));
        save.erase(unique(all(save)), save.end());
        fo(i, 0, (int)save.size() - 2)
            range.push_back({save[i], save[i + 1] - 1, inf});
        range.push_back({save.back(), n, inf});
        fo(i, 2, m) p[i] = p[i - 1] + r[i - 1] - l[i - 1] + 1;
        vi nen;
        vii up;
        fo(i, 1, m)
        {
            int sum = 0;
            int lb = lower_bound(all(save), l[i]) - save.begin();
            while (range[lb][1] <= r[i] and lb < range.size())
            {
                if (range[lb][2] != inf)
                {
                    nen.pb(p[i] - range[lb][2] + sum);
                    up.pb(p[i] - range[lb][2] + sum, range[lb][1] - range[lb][0] + 1);
                }
                range[lb][2] = p[i] + sum;
                sum += range[lb][1] - range[lb][0] + 1;
                lb++;
            }
        }
        fo(i, 1, q) nen.pb(s[i] + 1);
        sort(all(nen));
        nen.erase(unique(all(nen)), nen.end());
        for (auto [x, val] : up)
        {
            x = lower_bound(all(nen), x) - nen.begin() + 1;
            su[x] += val;
        }
        fod(i, maxn - 2, 0) su[i] += su[i + 1];
        fo(i, 1, q)
        {
            s[i] = lower_bound(all(nen), s[i] + 1) - nen.begin() + 1;
            cout << su[s[i]] << ' ';
        }
    }
}
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> q;
    fo(i, 1, m) cin >> l[i] >> r[i];
    fo(i, 1, q) cin >> s[i];
    if (m <= 2000)
        return sub4::solve(), 0;
    sub2::solve();
}

Compilation message

Main.cpp: In function 'void sub4::solve()':
Main.cpp:112:48: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |             while (range[lb][1] <= r[i] and lb < range.size())
      |                                             ~~~^~~~~~~~~~~~~~
Main.cpp: At global scope:
Main.cpp:140:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  140 | main()
      | ^~~~
Main.cpp: In instantiation of 'bool minimize(T1&, T2) [with T1 = long long int; T2 = long unsigned int]':
Main.cpp:74:48:   required from here
Main.cpp:23:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'long unsigned int' [-Wsign-compare]
   23 |     if (a > b)
      |         ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:145:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:146:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 86616 KB Output is correct
2 Correct 12 ms 86616 KB Output is correct
3 Correct 11 ms 86620 KB Output is correct
4 Correct 12 ms 87000 KB Output is correct
5 Correct 12 ms 86940 KB Output is correct
6 Correct 12 ms 86616 KB Output is correct
7 Correct 13 ms 87280 KB Output is correct
8 Correct 12 ms 86996 KB Output is correct
9 Correct 11 ms 87060 KB Output is correct
10 Correct 11 ms 86600 KB Output is correct
11 Correct 11 ms 86620 KB Output is correct
12 Correct 11 ms 86500 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 86616 KB Output is correct
2 Correct 12 ms 86616 KB Output is correct
3 Correct 11 ms 86620 KB Output is correct
4 Correct 12 ms 87000 KB Output is correct
5 Correct 12 ms 86940 KB Output is correct
6 Correct 12 ms 86616 KB Output is correct
7 Correct 13 ms 87280 KB Output is correct
8 Correct 12 ms 86996 KB Output is correct
9 Correct 11 ms 87060 KB Output is correct
10 Correct 11 ms 86600 KB Output is correct
11 Correct 11 ms 86620 KB Output is correct
12 Correct 11 ms 86500 KB Output is correct
13 Correct 125 ms 121212 KB Output is correct
14 Correct 74 ms 92852 KB Output is correct
15 Correct 144 ms 134012 KB Output is correct
16 Correct 169 ms 140396 KB Output is correct
17 Correct 78 ms 94832 KB Output is correct
18 Correct 127 ms 123460 KB Output is correct
19 Correct 125 ms 120948 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 86620 KB Output is correct
2 Correct 14 ms 87000 KB Output is correct
3 Correct 129 ms 124136 KB Output is correct
4 Correct 172 ms 141928 KB Output is correct
5 Runtime error 1146 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 86616 KB Output is correct
2 Correct 12 ms 86616 KB Output is correct
3 Correct 11 ms 86620 KB Output is correct
4 Correct 12 ms 87000 KB Output is correct
5 Correct 12 ms 86940 KB Output is correct
6 Correct 12 ms 86616 KB Output is correct
7 Correct 13 ms 87280 KB Output is correct
8 Correct 12 ms 86996 KB Output is correct
9 Correct 11 ms 87060 KB Output is correct
10 Correct 11 ms 86600 KB Output is correct
11 Correct 11 ms 86620 KB Output is correct
12 Correct 11 ms 86500 KB Output is correct
13 Correct 125 ms 121212 KB Output is correct
14 Correct 74 ms 92852 KB Output is correct
15 Correct 144 ms 134012 KB Output is correct
16 Correct 169 ms 140396 KB Output is correct
17 Correct 78 ms 94832 KB Output is correct
18 Correct 127 ms 123460 KB Output is correct
19 Correct 125 ms 120948 KB Output is correct
20 Correct 199 ms 156936 KB Output is correct
21 Correct 78 ms 94132 KB Output is correct
22 Correct 239 ms 186264 KB Output is correct
23 Correct 243 ms 188416 KB Output is correct
24 Correct 73 ms 92288 KB Output is correct
25 Correct 161 ms 141660 KB Output is correct
26 Correct 193 ms 157792 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 86616 KB Output is correct
2 Correct 12 ms 86616 KB Output is correct
3 Correct 11 ms 86620 KB Output is correct
4 Correct 12 ms 87000 KB Output is correct
5 Correct 12 ms 86940 KB Output is correct
6 Correct 12 ms 86616 KB Output is correct
7 Correct 13 ms 87280 KB Output is correct
8 Correct 12 ms 86996 KB Output is correct
9 Correct 11 ms 87060 KB Output is correct
10 Correct 11 ms 86600 KB Output is correct
11 Correct 11 ms 86620 KB Output is correct
12 Correct 11 ms 86500 KB Output is correct
13 Correct 125 ms 121212 KB Output is correct
14 Correct 74 ms 92852 KB Output is correct
15 Correct 144 ms 134012 KB Output is correct
16 Correct 169 ms 140396 KB Output is correct
17 Correct 78 ms 94832 KB Output is correct
18 Correct 127 ms 123460 KB Output is correct
19 Correct 125 ms 120948 KB Output is correct
20 Correct 11 ms 86620 KB Output is correct
21 Correct 14 ms 87000 KB Output is correct
22 Correct 129 ms 124136 KB Output is correct
23 Correct 172 ms 141928 KB Output is correct
24 Runtime error 1146 ms 1048576 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -