oj.uz

Submission #311832

# Submission time Handle Problem Language Result Execution time Memory
311832 2020-10-11T20:54:01 Z VROOM_VARUN Dragon 2 (JOI17_dragon2) C++17
15 / 100
 1059 ms 13944 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 int long long
#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



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

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 26 ms 512 KB Output is correct
2 Correct 47 ms 512 KB Output is correct
3 Correct 55 ms 1400 KB Output is correct
4 Correct 167 ms 13560 KB Output is correct
5 Correct 151 ms 13944 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 19 ms 512 KB Output is correct
9 Correct 18 ms 512 KB Output is correct
10 Correct 21 ms 512 KB Output is correct

Subtask #2
0 / 45.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 512 KB Output is correct
2 Correct 47 ms 512 KB Output is correct
3 Correct 55 ms 1400 KB Output is correct
4 Correct 167 ms 13560 KB Output is correct
5 Correct 151 ms 13944 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 19 ms 512 KB Output is correct
9 Correct 18 ms 512 KB Output is correct
10 Correct 21 ms 512 KB Output is correct
11 Incorrect 1059 ms 1728 KB Output isn't correct
12 Halted 0 ms 0 KB -