oj.uz

답안 #381899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
381899 2021-03-26T06:41:13 Z topovik Vepar (COCI21_vepar) C++14
70 / 70
 199 ms 43912 KB 
#include <bits/stdc++.h>
#include <chrono>
#define f first
#define s second
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 1e7 + 10;

int l[N];
vector <int> pr;

ll Time()
{
    return chrono::system_clock().now().time_since_epoch().count();
}

mt19937 rnd(Time());

int sum(int x, int y)
{
    if (x < y) return 0;
    else return (x / y) + sum(x / y, y);
}

int main()
{
    for (register int i = 2; i < N; i++)
    {
        if (l[i] == 0)
        {
            l[i] = i;
            pr.pb(i);
        }
        for (register int j = 0; pr[j] <= l[i] && pr[j] * i < N; j++) l[pr[j] * i] = pr[j];
    }
    int t;
    cin >> t;
    while (t--)
    {
        int l, r, l1, r1;
        cin >> l >> r >> l1 >> r1;
        bool g = 1;
        for (int i = 0; i < pr.size(); i++) g = g && (sum(r1, pr[i]) - sum(l1 - 1, pr[i])) >= (sum(r, pr[i]) - sum(l - 1, pr[i]));
        cout << (g ? "DA" : "NE") << endl;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int i = 0; i < pr.size(); i++) g = g && (sum(r1, pr[i]) - sum(l1 - 1, pr[i])) >= (sum(r, pr[i]) - sum(l - 1, pr[i]));
      |                         ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 43740 KB Output is correct
2 Correct 148 ms 43752 KB Output is correct
3 Correct 127 ms 43904 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 43740 KB Output is correct
2 Correct 133 ms 43744 KB Output is correct
3 Correct 129 ms 43740 KB Output is correct
4 Correct 133 ms 43740 KB Output is correct
5 Correct 125 ms 43776 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 43780 KB Output is correct
2 Correct 138 ms 43740 KB Output is correct
3 Correct 158 ms 43804 KB Output is correct
4 Correct 143 ms 43708 KB Output is correct
5 Correct 142 ms 43724 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 43852 KB Output is correct
2 Correct 142 ms 43784 KB Output is correct
3 Correct 135 ms 43684 KB Output is correct
4 Correct 155 ms 43760 KB Output is correct
5 Correct 155 ms 43740 KB Output is correct
6 Correct 149 ms 43740 KB Output is correct
7 Correct 196 ms 43740 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 43740 KB Output is correct
2 Correct 130 ms 43792 KB Output is correct
3 Correct 142 ms 43752 KB Output is correct
4 Correct 147 ms 43740 KB Output is correct
5 Correct 141 ms 43740 KB Output is correct
6 Correct 177 ms 43796 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 43740 KB Output is correct
2 Correct 125 ms 43740 KB Output is correct
3 Correct 143 ms 43740 KB Output is correct
4 Correct 139 ms 43740 KB Output is correct
5 Correct 142 ms 43740 KB Output is correct
6 Correct 179 ms 43740 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 43812 KB Output is correct
2 Correct 136 ms 43740 KB Output is correct
3 Correct 133 ms 43912 KB Output is correct
4 Correct 143 ms 43740 KB Output is correct
5 Correct 138 ms 43740 KB Output is correct
6 Correct 176 ms 43740 KB Output is correct
7 Correct 199 ms 43740 KB Output is correct