Submission #914707

#	Time	Username	Problem	Language	Result	Execution time	Memory
914707		bachhoangxuan	Dragon 2 (JOI17_dragon2)	C++17	100 / 100	2086 ms	3984 KiB

dragon2

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=30005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m,q;
vector<pii> p[maxn];

bool cross(pii x,pii y,pii z){
    return (x.fi-y.fi)*(z.se-y.se)-(z.fi-y.fi)*(x.se-y.se)<=0;
}

void solve(){
    cin >> n >> m;
    pii A,B;
    for(int i=1;i<=n;i++){
        int x;cin >> A.fi >> A.se >> x;
        p[x].push_back(A);
    }
    cin >> A.fi >> A.se >> B.fi >> B.se;
    cin >> q;
    for(int i=1;i<=q;i++){
        int x,y;cin >> x >> y;
        int M=0;
        for(auto i:p[x]) for(auto j:p[y]){
            if(cross(i,A,B)) M+=(cross(i,A,j) && cross(j,B,i));
            else M+=(cross(j,A,i) && cross(i,B,j));
        }
        cout << M << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 15 / 15
• Subtask 2: 45 / 45
• Subtask 3: 40 / 40