oj.uz

Submission #912447

# Submission time Handle Problem Language Result Execution time Memory
912447 2024-01-19T13:15:47 Z bachhoangxuan 별자리 2 (JOI14_constellation2) C++17
100 / 100
 950 ms 1012 KB 
// 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=3005;
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;

double PI = acos(-1.0);

struct vec{
    int x=0,y=0,c=0;
    double d;
    vec(int x=0,int y=0,int c=0):x(x),y(y),c(c){
        d=atan2(y,x);
    }
    bool operator<(vec a){
        return d<a.d;
    }
}P[2*maxn];

int n,X[maxn],Y[maxn],C[maxn];

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> X[i] >> Y[i] >> C[i],C[i];
    int ans=0;
    for(int t=1;t<=n;t++){
        for(int i=1;i<t;i++) P[i]=vec(X[i]-X[t],Y[i]-Y[t],C[i]);
        for(int i=t+1;i<=n;i++) P[i-1]=vec(X[i]-X[t],Y[i]-Y[t],C[i]);
        sort(P+1,P+n);
         vector<int> A(3,0),B(3,0);
         for(int i=1;i<n;i++){
            A[P[i].c]++;
            P[i+n-1]=P[i];
            P[i+n-1].d+=2*PI;
         }
         int res=1;
         for(int i=1,j=1;i<n;i++){
            while(P[i].d+PI>P[j].d) B[P[j++].c]++;
            int res=1;
            for(int k=0;k<3;k++){
                if(k!=C[t]) res*=(A[k]-B[k]);
                if(k!=P[i].c) res*=B[k];
            }
            ans+=res;
            B[P[i].c]--;
         }
    }
    cout << ans/2 << '\n';
}

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

Compilation message

constellation2.cpp: In function 'void solve()':
constellation2.cpp:70:58: warning: right operand of comma operator has no effect [-Wunused-value]
   70 |     for(int i=1;i<=n;i++) cin >> X[i] >> Y[i] >> C[i],C[i];
      |                                                       ~~~^
constellation2.cpp:82:14: warning: unused variable 'res' [-Wunused-variable]
   82 |          int res=1;
      |              ^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 9 ms 604 KB Output is correct
8 Correct 9 ms 604 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 6 ms 604 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 8 ms 604 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 600 KB Output is correct
2 Correct 80 ms 672 KB Output is correct
3 Correct 103 ms 852 KB Output is correct
4 Correct 102 ms 852 KB Output is correct
5 Correct 225 ms 600 KB Output is correct
6 Correct 387 ms 716 KB Output is correct
7 Correct 645 ms 604 KB Output is correct
8 Correct 919 ms 1012 KB Output is correct
9 Correct 937 ms 736 KB Output is correct
10 Correct 830 ms 736 KB Output is correct
11 Correct 950 ms 740 KB Output is correct
12 Correct 905 ms 740 KB Output is correct
13 Correct 914 ms 744 KB Output is correct
14 Correct 946 ms 740 KB Output is correct
15 Correct 870 ms 732 KB Output is correct
16 Correct 911 ms 744 KB Output is correct