oj.uz

Submission #319044

# Submission time Handle Problem Language Result Execution time Memory
319044 2020-11-03T19:09:24 Z fivefourthreeone Dragon 2 (JOI17_dragon2) C++17
100 / 100
 3867 ms 4196 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(auto i=(a);i<(b); ++i)
#define uwu(i,a, b) for(auto i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ttgl, null_type,less<ttgl>, rb_tree_tag,tree_order_statistics_node_update>*/
 
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = atan(1);
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 30001;
struct pt {
    ll x, y;
    pt(ll x = 0, ll y = 0) : x(x), y(y) {}
    bool operator < (const pt &o) const {
        return (x == o.x ? y < o.y : x < o.x);
    }
    pt operator - (const pt &o) const {
        return pt(x - o.x, y - o.y);
    }
};
ll cross(pt a, pt b) {
    return a.x * b.y - a.y * b.x;
}
bool ccw(pt &a, pt &b, pt &c) {
    return cross(a-b, c-b) <= 0;
}
vector<pt> tribe[mxN];
int n, m, q;
pt x, y;
bool chk(pt &a, pt &b) {
    if(ccw(a, x, y)) {
        if(ccw(a, x, b) && ccw(b, y, a))return 1;
    }else {
        if(ccw(b, x, a) && ccw(a, y, b))return 1;
    }
    return 0;
}
int main() {
    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w", stdout);
    mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin.tie(0)->sync_with_stdio(0);
    scanf("%d %d\n", &n, &m);
    int a, b, c;
    owo(i, 0, n) {
        scanf("%d %d %d\n", &a, &b, &c);
        tribe[c].senpai({a, b});
    }
    scanf("%lld %lld %lld %lld\n", &x.x, &x.y, &y.x, &y.y);
    scanf("%d\n", &q);
    while(q--) {
        scanf("%d %d\n", &a, &b);
            int res = 0;
            for(auto &k1: tribe[a]) {
                for(auto &k2: tribe[b]) {
                    res+=chk(k1, k2);
                }
            }
            printf("%d \n", res);
    }
    return 0;
}

Compilation message

dragon2.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
dragon2.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
dragon2.cpp: In function 'int main()':
dragon2.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     scanf("%d %d\n", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
dragon2.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |         scanf("%d %d %d\n", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |     scanf("%lld %lld %lld %lld\n", &x.x, &x.y, &y.x, &y.y);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |     scanf("%d\n", &q);
      |     ~~~~~^~~~~~~~~~~~
dragon2.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |         scanf("%d %d\n", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1132 KB Output is correct
2 Correct 38 ms 1132 KB Output is correct
3 Correct 42 ms 1132 KB Output is correct
4 Correct 50 ms 1508 KB Output is correct
5 Correct 38 ms 1380 KB Output is correct
6 Correct 3 ms 1132 KB Output is correct
7 Correct 3 ms 1132 KB Output is correct
8 Correct 14 ms 1132 KB Output is correct
9 Correct 14 ms 1132 KB Output is correct
10 Correct 14 ms 1132 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1787 ms 1824 KB Output is correct
2 Correct 3567 ms 1892 KB Output is correct
3 Correct 92 ms 2028 KB Output is correct
4 Correct 14 ms 1900 KB Output is correct
5 Correct 15 ms 1900 KB Output is correct
6 Correct 1768 ms 1796 KB Output is correct
7 Correct 1747 ms 1800 KB Output is correct
8 Correct 1174 ms 1888 KB Output is correct
9 Correct 1178 ms 1648 KB Output is correct
10 Correct 1177 ms 1884 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1132 KB Output is correct
2 Correct 38 ms 1132 KB Output is correct
3 Correct 42 ms 1132 KB Output is correct
4 Correct 50 ms 1508 KB Output is correct
5 Correct 38 ms 1380 KB Output is correct
6 Correct 3 ms 1132 KB Output is correct
7 Correct 3 ms 1132 KB Output is correct
8 Correct 14 ms 1132 KB Output is correct
9 Correct 14 ms 1132 KB Output is correct
10 Correct 14 ms 1132 KB Output is correct
11 Correct 1787 ms 1824 KB Output is correct
12 Correct 3567 ms 1892 KB Output is correct
13 Correct 92 ms 2028 KB Output is correct
14 Correct 14 ms 1900 KB Output is correct
15 Correct 15 ms 1900 KB Output is correct
16 Correct 1768 ms 1796 KB Output is correct
17 Correct 1747 ms 1800 KB Output is correct
18 Correct 1174 ms 1888 KB Output is correct
19 Correct 1178 ms 1648 KB Output is correct
20 Correct 1177 ms 1884 KB Output is correct
21 Correct 1796 ms 1884 KB Output is correct
22 Correct 3530 ms 1900 KB Output is correct
23 Correct 3867 ms 2300 KB Output is correct
24 Correct 884 ms 3936 KB Output is correct
25 Correct 63 ms 3812 KB Output is correct
26 Correct 55 ms 4068 KB Output is correct
27 Correct 21 ms 3052 KB Output is correct
28 Correct 19 ms 3052 KB Output is correct
29 Correct 3571 ms 3808 KB Output is correct
30 Correct 89 ms 3680 KB Output is correct
31 Correct 53 ms 3808 KB Output is correct
32 Correct 84 ms 3872 KB Output is correct
33 Correct 956 ms 3940 KB Output is correct
34 Correct 56 ms 4068 KB Output is correct
35 Correct 55 ms 3812 KB Output is correct
36 Correct 55 ms 3812 KB Output is correct
37 Correct 58 ms 4068 KB Output is correct
38 Correct 1702 ms 4160 KB Output is correct
39 Correct 1340 ms 3940 KB Output is correct
40 Correct 980 ms 4196 KB Output is correct
41 Correct 3304 ms 3940 KB Output is correct
42 Correct 2450 ms 4072 KB Output is correct
43 Correct 2094 ms 3812 KB Output is correct
44 Correct 2111 ms 2780 KB Output is correct
45 Correct 1012 ms 2788 KB Output is correct
46 Correct 652 ms 2788 KB Output is correct
47 Correct 1843 ms 2844 KB Output is correct
48 Correct 1082 ms 2660 KB Output is correct
49 Correct 666 ms 2668 KB Output is correct