AtCoder Beginner Contest 033

Submission #1292358

Source codeソースコード

#include <iostream>
#include <sys/time.h>
#include <bits/stdc++.h>
#include <pthread.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
#define exists find_if
#define forall all_of

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using Pos = complex<double>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
string bits_to_string(ll input, ll n=64) { string s; rep(i, n) s += '0' + !!(input & (1ll << i)); reverse(all(s)); return s; }

template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
struct ci : public iterator<forward_iterator_tag, ll> { ll n; ci(const ll n) : n(n) { } bool operator==(const ci& x) { return n == x.n; } bool operator!=(const ci& x) { return !(*this == x); } ci &operator++() { n++; return *this; } ll operator*() const { return n; } };

size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
namespace myhash{ const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81}; const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2}; const int hash_key=xor_nums[rand()%20]; const int mod_key=xor_nums[rand()%20]; template <typename T> struct myhash{ std::size_t operator()(const T& val) const { return (hash<T>{}(val)%mod_key)^hash_key; } }; };
template <typename T> class uset:public std::unordered_set<T,myhash::myhash<T>> { using SET=std::unordered_set<T,myhash::myhash<T>>; public: uset():SET(){SET::rehash(myhash::Bsizes[rand()%20]);} };
template <typename T,typename U> class umap:public std::unordered_map<T,U,myhash::myhash<T>> { public: using MAP=std::unordered_map<T,U,myhash::myhash<T>>; umap():MAP(){MAP::rehash(myhash::Bsizes[rand()%20]);} };    

struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ gettimeofday(&start, NULL); ios::sync_with_stdio(false); cin.tie(0); srand((unsigned int)time(NULL)); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;

static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40) 


#define PTHREAD

#if defined(_WIN32)
extern "C" {
    void* __stdcall LoadLibraryA(const char *name);
    void* __stdcall GetProcAddress(void *handle, const char *name);
}
struct DynamicLibrary {
    DynamicLibrary(const char *name) { _handle = LoadLibraryA(name); }
    void *get(const char *name) const { void *p = GetProcAddress(_handle, name); if(!p) cerr << "can't find: " << name << endl, abort(); return p; }
    void *_handle;
} gmp("mpir.dll");
#else
extern "C" {
    void* __libc_dlopen_mode(const char *x, int y);
    void* __libc_dlsym(void *x, const char *y);
}
struct DynamicLibrary {
    DynamicLibrary(const char *name) { _handle = __libc_dlopen_mode(name, 2); }
    void *get(const char *name) const { void *p = __libc_dlsym(_handle, name); if(!p) cerr << "can't find: " << name << endl, abort(); return p; }
    void *_handle;
#ifndef PTHREAD
} gmp("/usr/lib/x86_64-linux-gnu/libgmp.so.10");	// hamko
#else
} libpthread("/lib/x86_64-linux-gnu/libpthread.so.0");	// hamko
//} libpthread("/usr/lib64/libpthread.so.0");	// yukicoder
#endif
#endif

#define EXPAND_MACRO_TO_STR_2(a) #a
#define EXPAND_MACRO_TO_STR(a) EXPAND_MACRO_TO_STR_2(a)

#ifndef PTHREAD
#include <gmp.h>
#define D(name) const auto my_##name = (decltype(::name)*)gmp.get(EXPAND_MACRO_TO_STR(name))
D(mpz_init_set_str);
D(mpz_popcount);
#else
#define D(name) const auto my_##name = (decltype(::name)*)libpthread.get(EXPAND_MACRO_TO_STR(name))
D(pthread_create);
D(pthread_join);
D(pthread_mutex_lock);
D(pthread_mutex_unlock);
#endif

#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))

int flag=1;
int balance=10000;
int cash=0;

pthread_mutex_t mtx = PTHREAD_MUTEX_INITIALIZER;

function<void(ll)> parallel_rep_solve;
vll parallel_rep_range;
void* parallel_rep_helper(void* arg) {
    //    cout << (*(ll*)arg) << endl;
    ll l = parallel_rep_range[0 + *(ll*)arg];
    ll r = parallel_rep_range[1 + *(ll*)arg];
    free(arg);
    //    cout << l << " " << r << "#thread" << endl;
    repi(j, l, r)
        parallel_rep_solve(j);
    return NULL;
}
void parallel_rep(int n, function<void(ll)> f, ll thnum = 50) {
    if (thnum == 1) { rep(i, n) f(i); return; } // やりたいこと

    parallel_rep_solve = f;
    parallel_rep_range.resize(thnum);
    rep(i, thnum) parallel_rep_range[i] = i * n / thnum;
    parallel_rep_range.pb(n);
    //    cout << parallel_rep_range << endl;
    vector<pthread_t> t(thnum);
    rep(i, thnum) {
        ll* i_pointer = (ll*)malloc(sizeof(ll));
        *i_pointer = i;
        my_pthread_create(&t[i], NULL, parallel_rep_helper, i_pointer);
    }
    rep(i, thnum) {
        my_pthread_join(t[i], NULL);
    }
}

//------------------

ll n;
vll x, y;
vvll d;
vll r0, r1;
void solve(ll i) {
    repi(j, i+1, n) repi(h, j+1, n) {
        ll a = d[i][j], b = d[j][h], c = d[h][i];
        ll m = a;
        if (m < b) m = b;
        if (m < c) m = c;
        m = a + b + c - m - m;
        if (m > 0) r0[i]++;
        else if (m == 0) r1[i]++;
    }

}

int main()
{
    cin >> n;
    x.resize(n);
    y.resize(n);
    d.resize(n); rep(i, n) d[i].resize(n);

    rep(i, n) {
        cin >> x[i] >> y[i];
    }

    rep(i, n) rep(j, n)
        d[i][j] = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);

    ll thnum = 10;
    r0.resize(n);
    r1.resize(n);
    parallel_rep(n, solve, thnum);
    ll ret0 = accumulate(all(r0), 0ll);
    ll ret1 = accumulate(all(r1), 0ll);
    cout << ret0 << " " << ret1 << " " << n * (n - 1) * (n - 2) / 6 - ret0 - ret1 << endl;
    return 0;
}

Submission

Task問題 D - 三角形の分類
User nameユーザ名 はむこ
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 TLE
Score得点 30
Source lengthソースコード長 8986 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
subtask01 30 / 30 01-00.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt,01-11.txt,01-12.txt,01-13.txt,01-14.txt,01-15.txt,01-16.txt,01-17.txt,01-18.txt,01-19.txt,01-handmade00.txt,01-handmade01.txt,01-handmade02.txt,01-handmade03.txt,01-handmade04.txt,01-handmade05.txt,sample-01.txt,sample-02.txt
subtask02 0 / 70 01-00.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt,01-11.txt,01-12.txt,01-13.txt,01-14.txt,01-15.txt,01-16.txt,01-17.txt,01-18.txt,01-19.txt,01-handmade00.txt,01-handmade01.txt,01-handmade02.txt,01-handmade03.txt,01-handmade04.txt,01-handmade05.txt,02-00.txt,02-01.txt,02-02.txt,02-03.txt,02-04.txt,02-05.txt,02-06.txt,02-07.txt,02-08.txt,02-09.txt,02-10.txt,02-11.txt,02-12.txt,02-13.txt,02-14.txt,02-15.txt,02-16.txt,02-17.txt,02-18.txt,02-19.txt,02-handmade00.txt,02-handmade01.txt,02-handmade02.txt,02-handmade03.txt,02-handmade04.txt,02-handmade05.txt,sample-01.txt,sample-02.txt,sample-01.txt,sample-02.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-00.txt AC 2 ms 512 KB
01-01.txt AC 2 ms 384 KB
01-02.txt AC 2 ms 384 KB
01-03.txt AC 2 ms 384 KB
01-04.txt AC 2 ms 384 KB
01-05.txt AC 2 ms 512 KB
01-06.txt AC 2 ms 432 KB
01-07.txt AC 2 ms 432 KB
01-08.txt AC 2 ms 432 KB
01-09.txt AC 2 ms 384 KB
01-10.txt AC 2 ms 432 KB
01-11.txt AC 2 ms 384 KB
01-12.txt AC 2 ms 432 KB
01-13.txt AC 2 ms 432 KB
01-14.txt AC 2 ms 432 KB
01-15.txt AC 2 ms 432 KB
01-16.txt AC 2 ms 512 KB
01-17.txt AC 2 ms 512 KB
01-18.txt AC 3 ms 4480 KB
01-19.txt AC 2 ms 432 KB
01-handmade00.txt AC 2 ms 512 KB
01-handmade01.txt AC 2 ms 432 KB
01-handmade02.txt AC 2 ms 384 KB
01-handmade03.txt AC 2 ms 384 KB
01-handmade04.txt AC 2 ms 512 KB
01-handmade05.txt AC 2 ms 432 KB
02-00.txt AC 7 ms 640 KB
02-01.txt AC 47 ms 1664 KB
02-02.txt AC 48 ms 1664 KB
02-03.txt AC 442 ms 4272 KB
02-04.txt AC 436 ms 4272 KB
02-05.txt AC 278 ms 6272 KB
02-06.txt AC 1655 ms 8240 KB
02-07.txt AC 1653 ms 8192 KB
02-08.txt AC 1652 ms 8192 KB
02-09.txt AC 1648 ms 8240 KB
02-10.txt AC 1190 ms 10240 KB
02-11.txt AC 1655 ms 8240 KB
02-12.txt AC 1650 ms 8240 KB
02-13.txt TLE
02-14.txt TLE
02-15.txt TLE
02-16.txt TLE
02-17.txt TLE
02-18.txt TLE
02-19.txt TLE
02-handmade00.txt AC 3753 ms 17408 KB
02-handmade01.txt TLE
02-handmade02.txt AC 6056 ms 20096 KB
02-handmade03.txt TLE
02-handmade04.txt TLE
02-handmade05.txt TLE
sample-01.txt AC 3 ms 4480 KB
sample-02.txt AC 2 ms 432 KB