oj.uz

Submission #366284

# Submission time Handle Problem Language Result Execution time Memory
366284 2021-02-13T19:08:41 Z model_code Vepar (COCI21_vepar) C++17
70 / 70
 872 ms 14648 KB 
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cerr << #x << " " << x << endl
#define _ << " " <<
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
typedef std::pair<int, int> pii;
#define X first
#define Y second
#define double long double
typedef double db;
using namespace std;

const int MAX = 1e7 + 5;


vector<int> primes;
bool sieved[MAX+10];
int A, B, C, D;

void precompute_primes() {
  for (int p = 2; p < MAX; p++) {
    if (!sieved[p]) primes.push_back(p);
    for (int i = p; i < MAX; i += p) {
      sieved[i] = true;
    }
  }
}

int val(int p, int A) {
  if (A == 0) return 0;
  return A/p + val(p, A/p); 
}

void solve() {
  for (auto p: primes) {
    if (val(p, B) + val(p, C) > val(p, A) + val(p, D)) {
      TRACE(p);
      cout << "NE" << endl;
      return;
    }
  } 
  cout << "DA" << endl;
}

void load() {
  cin >> A >> B >> C >> D;
  A--; C--;
}

int main() {
  ios_base::sync_with_stdio(false);
  precompute_primes();
  int T;
  cin >> T;
  REP(tt, T) {
    load();	
    solve();
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 738 ms 14436 KB Output is correct
2 Correct 756 ms 14564 KB Output is correct
3 Correct 716 ms 14308 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 738 ms 14308 KB Output is correct
2 Correct 740 ms 14468 KB Output is correct
3 Correct 728 ms 14308 KB Output is correct
4 Correct 742 ms 14436 KB Output is correct
5 Correct 774 ms 14524 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 725 ms 14436 KB Output is correct
2 Correct 692 ms 14308 KB Output is correct
3 Correct 724 ms 14564 KB Output is correct
4 Correct 710 ms 14308 KB Output is correct
5 Correct 731 ms 14436 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 852 ms 14564 KB Output is correct
2 Correct 779 ms 14308 KB Output is correct
3 Correct 668 ms 14392 KB Output is correct
4 Correct 755 ms 14308 KB Output is correct
5 Correct 703 ms 14392 KB Output is correct
6 Correct 728 ms 14648 KB Output is correct
7 Correct 834 ms 14308 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 756 ms 14564 KB Output is correct
2 Correct 717 ms 14564 KB Output is correct
3 Correct 714 ms 14316 KB Output is correct
4 Correct 718 ms 14308 KB Output is correct
5 Correct 697 ms 14564 KB Output is correct
6 Correct 775 ms 14328 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 760 ms 14564 KB Output is correct
2 Correct 635 ms 14308 KB Output is correct
3 Correct 733 ms 14396 KB Output is correct
4 Correct 671 ms 14444 KB Output is correct
5 Correct 713 ms 14308 KB Output is correct
6 Correct 743 ms 14308 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 749 ms 14308 KB Output is correct
2 Correct 768 ms 14564 KB Output is correct
3 Correct 737 ms 14356 KB Output is correct
4 Correct 704 ms 14436 KB Output is correct
5 Correct 738 ms 14452 KB Output is correct
6 Correct 765 ms 14436 KB Output is correct
7 Correct 872 ms 14436 KB Output is correct