oj.uz

Submission #997289

# Submission time Handle Problem Language Result Execution time Memory
997289 2024-06-12T02:30:08 Z cpptowin Inspections (NOI23_inspections) C++17
11 / 100
 1221 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 1000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#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,n) minimize(s[i],v.size() + 1);
        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) << ' ';
    }
}
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];
    sub2::solve();
}

Compilation message

Main.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main()
      | ^~~~
Main.cpp: In instantiation of 'bool minimize(T1&, T2) [with T1 = long long int; T2 = long unsigned int]':
Main.cpp:74:45:   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:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:91:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 7004 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 7128 KB Output is correct
8 Correct 1 ms 9052 KB Output is correct
9 Correct 2 ms 7128 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6744 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 7004 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 7128 KB Output is correct
8 Correct 1 ms 9052 KB Output is correct
9 Correct 2 ms 7128 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6744 KB Output is correct
13 Correct 54 ms 41132 KB Output is correct
14 Correct 29 ms 11212 KB Output is correct
15 Correct 62 ms 50592 KB Output is correct
16 Incorrect 66 ms 52648 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 7128 KB Output is correct
3 Correct 60 ms 53136 KB Output is correct
4 Runtime error 1221 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 7004 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 7128 KB Output is correct
8 Correct 1 ms 9052 KB Output is correct
9 Correct 2 ms 7128 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6744 KB Output is correct
13 Correct 54 ms 41132 KB Output is correct
14 Correct 29 ms 11212 KB Output is correct
15 Correct 62 ms 50592 KB Output is correct
16 Incorrect 66 ms 52648 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 7004 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 7128 KB Output is correct
8 Correct 1 ms 9052 KB Output is correct
9 Correct 2 ms 7128 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6744 KB Output is correct
13 Correct 54 ms 41132 KB Output is correct
14 Correct 29 ms 11212 KB Output is correct
15 Correct 62 ms 50592 KB Output is correct
16 Incorrect 66 ms 52648 KB Output isn't correct
17 Halted 0 ms 0 KB -