oj.uz

Submission #311835

# Submission time Handle Problem Language Result Execution time Memory
311835 2020-10-11T20:56:37 Z VROOM_VARUN Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 18936 KB 
/*
ID: varunra2
LANG: C++
TASK: dragon
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

inline ll ccw(PII& a, PII& b, PII& c) {
  return 1ll * a.x * b.y - 1ll * a.y * b.x + 1ll * b.x * c.y - 1ll * b.y * c.x +
         1ll * c.x * a.y - 1ll * c.y * a.x;
}

inline bool ad(PII& a, PII& b, PII& c, PII& d) {
  if (ccw(c, d, a) <= 0) {
    return (ccw(a, c, b) <= 0 and ccw(b, d, a) <= 0);
  }
  return ccw(a, d, b) <= 0 and ccw(b, c, a) <= 0;
}

ll cnt = 0;

void d() {
  // cnt++;
  // if(cnt >= (int)1e8) {
  // exit(0);
  // }
}

int32_t main() {
  // #ifndef ONLINE_JUDGE
  // freopen("dragon.in", "r", stdin);
  // freopen("dragon.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  map<int, MPII> dp;
  map<int, MPII> dne;
  int n, m, q;

  cin >> n >> m;

  VII vals(n);
  VI c(n);

  vector<VII> gps(m);

  for (int i = 0; i < n; i++) {
    cin >> vals[i].x >> vals[i].y;
    cin >> c[i];
    c[i]--;
    gps[c[i]].PB(vals[i]);
  }

  PII v1, v2;
  cin >> v1.x >> v1.y >> v2.x >> v2.y;

  cin >> q;

  while (q--) {
    PII cur;
    cin >> cur.x >> cur.y;
    cur.x--, cur.y--;
    if (dne[cur.x][cur.y]) {
      cout << dp[cur.x][cur.y] << '\n';
    } else {
      int ret = 0;
      dne[cur.x][cur.y]++;
      trav(x, gps[cur.x]) {
        trav(y, gps[cur.y]) {
          d();
          if (ad(x, y, v1, v2)) {
            ret++;
          }
        }
      }
      dp[cur.x][cur.y] = ret;
      cout << ret << '\n';
    }
  }

  return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 384 KB Output is correct
2 Correct 32 ms 384 KB Output is correct
3 Correct 45 ms 888 KB Output is correct
4 Correct 157 ms 10236 KB Output is correct
5 Correct 142 ms 10616 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1767 ms 1144 KB Output is correct
2 Correct 3133 ms 1144 KB Output is correct
3 Correct 73 ms 1920 KB Output is correct
4 Correct 13 ms 1920 KB Output is correct
5 Correct 15 ms 2816 KB Output is correct
6 Correct 1256 ms 1872 KB Output is correct
7 Correct 1244 ms 1912 KB Output is correct
8 Correct 729 ms 1912 KB Output is correct
9 Correct 654 ms 1628 KB Output is correct
10 Correct 746 ms 1784 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 384 KB Output is correct
2 Correct 32 ms 384 KB Output is correct
3 Correct 45 ms 888 KB Output is correct
4 Correct 157 ms 10236 KB Output is correct
5 Correct 142 ms 10616 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 1767 ms 1144 KB Output is correct
12 Correct 3133 ms 1144 KB Output is correct
13 Correct 73 ms 1920 KB Output is correct
14 Correct 13 ms 1920 KB Output is correct
15 Correct 15 ms 2816 KB Output is correct
16 Correct 1256 ms 1872 KB Output is correct
17 Correct 1244 ms 1912 KB Output is correct
18 Correct 729 ms 1912 KB Output is correct
19 Correct 654 ms 1628 KB Output is correct
20 Correct 746 ms 1784 KB Output is correct
21 Correct 1767 ms 1784 KB Output is correct
22 Correct 3141 ms 1824 KB Output is correct
23 Correct 3134 ms 2428 KB Output is correct
24 Correct 1057 ms 12664 KB Output is correct
25 Correct 189 ms 14584 KB Output is correct
26 Correct 189 ms 18936 KB Output is correct
27 Correct 29 ms 7544 KB Output is correct
28 Correct 29 ms 7552 KB Output is correct
29 Execution timed out 4091 ms 17160 KB Time limit exceeded
30 Halted 0 ms 0 KB -