oj.uz

답안 #929048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
929048 2024-02-17T14:46:24 Z Amirreza_Fakhri Vepar (COCI21_vepar) C++17
70 / 70
 574 ms 173792 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 1e7+5;

int t, a, b, c, d, cnt[2][maxn];
bool mark[maxn];
vector <int> primes;

void relax(int x, int p, int i, int v) {
    x /= p;
    while (x) {
        cnt[i][p] += x*v;
        x /= p;
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    for (int i = 2; i < maxn; i++) {
        if (!mark[i]) primes.pb(i);
        for (int p : primes) {
            if (p*i >= maxn) break;
            mark[p*i] = 1;
            if (!(i%p)) break;
        }
    }
    cin >> t;
    while (t--) {
        cin >> a >> b >> c >> d; a--, c--;
        for (int p : primes) {
            relax(a, p, 0, 1), relax(d, p, 0, 1);
        }
        for (int p : primes) {
            relax(b, p, 1, 1), relax(c, p, 1, 1);
        }
        bool f = 1;
        for (int p : primes) {
            if (cnt[1][p] > cnt[0][p]) f = 0;
        }
        if (f) cout << "DA\n";
        else cout << "NE\n";
        for (int p : primes) {
            relax(a, p, 0, -1), relax(d, p, 0, -1);
        }
        for (int p : primes) {
            relax(b, p, 1, -1), relax(c, p, 1, -1);
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 327 ms 19440 KB Output is correct
2 Correct 326 ms 20592 KB Output is correct
3 Correct 327 ms 21188 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 300 ms 19692 KB Output is correct
2 Correct 327 ms 19652 KB Output is correct
3 Correct 326 ms 20776 KB Output is correct
4 Correct 323 ms 19596 KB Output is correct
5 Correct 328 ms 19988 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 299 ms 21188 KB Output is correct
2 Correct 331 ms 19388 KB Output is correct
3 Correct 324 ms 19140 KB Output is correct
4 Correct 325 ms 20416 KB Output is correct
5 Correct 334 ms 21032 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 416 ms 78772 KB Output is correct
2 Correct 394 ms 57020 KB Output is correct
3 Correct 540 ms 154576 KB Output is correct
4 Correct 451 ms 82656 KB Output is correct
5 Correct 447 ms 85796 KB Output is correct
6 Correct 331 ms 172464 KB Output is correct
7 Correct 564 ms 173236 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 548 ms 172680 KB Output is correct
2 Correct 356 ms 32424 KB Output is correct
3 Correct 355 ms 36964 KB Output is correct
4 Correct 396 ms 71348 KB Output is correct
5 Correct 407 ms 69132 KB Output is correct
6 Correct 547 ms 173736 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 549 ms 173276 KB Output is correct
2 Correct 358 ms 31996 KB Output is correct
3 Correct 357 ms 38696 KB Output is correct
4 Correct 413 ms 73004 KB Output is correct
5 Correct 412 ms 80312 KB Output is correct
6 Correct 540 ms 173492 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 555 ms 173792 KB Output is correct
2 Correct 357 ms 33260 KB Output is correct
3 Correct 352 ms 33004 KB Output is correct
4 Correct 401 ms 68788 KB Output is correct
5 Correct 402 ms 73156 KB Output is correct
6 Correct 542 ms 173428 KB Output is correct
7 Correct 574 ms 173492 KB Output is correct