結果

問題 No.1121 Social Distancing in Cinema
ユーザー ThistleThistle
提出日時 2020-07-04 23:29:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 7,366 bytes
コンパイル時間 2,443 ms
コンパイル使用メモリ 145,788 KB
実行使用メモリ 17,828 KB
最終ジャッジ日時 2024-09-19 15:40:36
合計ジャッジ時間 7,141 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
13,696 KB
testcase_01 AC 6 ms
8,448 KB
testcase_02 AC 6 ms
8,320 KB
testcase_03 AC 5 ms
8,320 KB
testcase_04 AC 5 ms
8,320 KB
testcase_05 AC 5 ms
8,320 KB
testcase_06 AC 5 ms
8,320 KB
testcase_07 AC 5 ms
8,320 KB
testcase_08 AC 5 ms
8,192 KB
testcase_09 AC 5 ms
8,320 KB
testcase_10 AC 5 ms
8,192 KB
testcase_11 AC 6 ms
8,192 KB
testcase_12 AC 5 ms
8,320 KB
testcase_13 AC 5 ms
8,320 KB
testcase_14 AC 7 ms
8,704 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-(b).begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
#define found(a,x) (a.find(x)!=a.end())
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
class mint {
public:ll v;
      mint(ll v = 0) { s(v % mod + mod); }
      constexpr static int mod = 1e9 + 7;
      constexpr static int fn_ = 3e5 + 5;
      static mint fact[fn_], comp[fn_];
      mint pow(int x) const {
          mint b(v), c(1);
          while (x) {
              if (x & 1) c *= b;
              b *= b;
              x >>= 1;
          }
          return c;
      }
      inline mint& s(int vv) {
          v = vv < mod ? vv : vv - mod;
          return *this;
      }
      inline mint inv()const { return pow(mod - 2); }
      inline mint operator-()const { return mint() - *this; }
      inline mint& operator+=(const mint b) { return s(v + b.v); }
      inline mint& operator-=(const mint b) { return s(v + mod - b.v); }
      inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }
      inline mint& operator/=(const mint b) { v = v * b.inv().v % mod; return *this; }
      inline mint operator+(const mint b) const { return mint(v) += b; }
      inline mint operator-(const mint b) const { return mint(v) -= b; }
      inline mint operator*(const mint b) const { return mint(v) *= b; }
      inline mint operator/(const mint b) const { return mint(v) /= b; }
      friend ostream& operator<<(ostream& os, const mint& m) {
          return os << m.v;
      }
      friend istream& operator>>(istream& is, mint& m) {
          int x; is >> x; m = mint(x);
          return is;
      }
      bool operator<(const mint& r)const { return v < r.v; }
      bool operator>(const mint& r)const { return v > r.v; }
      bool operator<=(const mint& r)const { return v <= r.v; }
      bool operator>=(const mint& r)const { return v >= r.v; }
      bool operator==(const mint& r)const { return v == r.v; }
      bool operator!=(const mint& r)const { return v != r.v; }
      explicit operator bool()const { return v; }
      explicit operator int()const { return v; }
      mint comb(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              if (k > * this - k) k = *this - k;
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp * comp[k.v];
          }
          return fact[v] * comp[k.v] * comp[v - k.v];
      }//nCk
      mint perm(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp;
          }
          return fact[v] * comp[v - k.v];
      }
      static void combinit() {
          fact[0] = 1;
          for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);
          comp[fn_ - 1] = fact[fn_ - 1].inv();
          for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);
      }
}; mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------


//---------------------------------------------------------------------
H a[300000];
bool b[600][600];
int c[600][600];

signed main() {
    int n; cin >> n;
    rep(i, n) {
        a[i] = readh(1);
        c[a[i].fs][a[i].sc] = i + 1;
    }

    sort(a, a + n, [&](H a, H b) {
        return (a.fs - 250) * (a.fs - 250) + (a.sc - 250) * (a.sc - 250) < (b.fs - 250) * (b.fs - 250) + (b.sc - 250) * (b.sc - 250);
        });


    auto longer = [&](H a, H b) ->bool {
        return ((a.fs - b.fs) * (a.fs - b.fs) + (a.sc - b.sc) * (a.sc - b.sc) < 100);
    };
    vec<H>ans;
    mt19937 rnd;
    int sum = 0;
loop:;

    rep(j, n) {
        int i = j;


        if (b[a[i].fs][a[i].sc]) continue;


        ans.pb(a[i]);

        int t = a[i].fs, l = max(0ll, a[i].sc - 9), r = min(a[i].sc + 9, 499ll);
        for (int t = a[i].fs; t >= a[i].fs - 9; t--) {
            while (l < 500 && !longer(H{ t,l }, a[i])) l++;
            while (r >= 0 && !longer(H{ t,r }, a[i])) r--;
            rng(i, l, r + 1) b[t][i] = 1;
        }
        t = a[i].fs, l = max(0ll, a[i].sc - 9), r = min(a[i].sc + 9, 499ll);
        rng(t, a[i].fs, a[i].fs + 10) {
            while (l < 500 && !longer(H{ t,l }, a[i])) l++;
            while (r >= 0 && !longer(H{ t,r }, a[i])) r--;
            rng(i, l, r + 1) b[t][i] = 1;
        }
    }
    if (siz(ans) * 90 < n) {
        ans.clear();
        if (!sum) sort(a, a + n);
        else if (sum == 1) sort(a, a + n, greater<H>());
        else sort(a, a + n, [&](H a, H b) {
            return (a.fs - 249) * (a.fs - 249) + (a.sc - 249) * (a.sc - 249) < (b.fs - 249) * (b.fs - 249) + (b.sc - 249) * (b.sc - 249);
            });
        sum++;
        goto loop;
    }
    cout << siz(ans) << endl;
    rep(i, siz(ans)) {
        cout << c[ans[i].fs][ans[i].sc] << ssp(i, siz(ans));
    }
}
0