oj.uz

Submission #381993

# Submission time Handle Problem Language Result Execution time Memory
381993 2021-03-26T08:43:27 Z Vimmer Vepar (COCI21_vepar) C++14
30 / 70
 346 ms 332908 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define N 100500
#define NN 12000005
#define PB push_back
#define endl '\n'
#define pri(x) cout << x << endl
#define _ << " " <<
#define sz(x) int(x.size())
#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;

//typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ord_set;

vector <int> vr[NN];

//int mk[NN], kol[NN], id;

int kol[NN];

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    freopen("1.in", "r", stdin);

    for (int i = 2; i < N; i++)
    {
        if (sz(vr[i]) != 0) continue;

        for (int j = i; j < N; j += i)
            {
                int x = j;

                while (x % i == 0)
                {
                    vr[j].PB(i);

                    x /= i;
                }
            }
    }

    for (int i = 2; i < N; i++)
    {
        int x = 1;

        for (auto it : vr[i])
            x *= it;

        if (x != i)
            assert(0);
    }

    int q;

    cin >> q;

    for (; q > 0; q--)
    {
        int a, b, c, d;

        cin >> a >> b >> c >> d;

        memset(kol, 0, sizeof kol);

        for (int i = c; i <= d; i++)
            for (auto it : vr[i])
            {
                kol[it]++;
            }

        bool gd = 1;

        for (int i = a; i <= b && gd; i++)
            for (auto it : vr[i])
            {
                kol[it]--;

                if (kol[it] == -1)
                {
                    gd = 0;

                    break;
                }
            }

        if (gd)
        {
            pri("DA");
        }
        else
        {
            pri("NE");
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 332652 KB Output is correct
2 Correct 283 ms 332652 KB Output is correct
3 Correct 282 ms 332780 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 332652 KB Output is correct
2 Correct 281 ms 332652 KB Output is correct
3 Correct 276 ms 332728 KB Output is correct
4 Correct 281 ms 332652 KB Output is correct
5 Correct 277 ms 332652 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 332652 KB Output is correct
2 Correct 280 ms 332908 KB Output is correct
3 Correct 284 ms 332652 KB Output is correct
4 Correct 282 ms 332780 KB Output is correct
5 Correct 284 ms 332652 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 311 ms 332652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 343 ms 332780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 332780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 345 ms 332780 KB Output isn't correct
2 Halted 0 ms 0 KB -