結果

問題 No.202 1円玉投げ
ユーザー fumiphysfumiphys
提出日時 2019-10-04 12:28:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 825 ms / 5,000 ms
コード長 3,537 bytes
コンパイル時間 1,455 ms
コンパイル使用メモリ 167,220 KB
実行使用メモリ 321,372 KB
最終ジャッジ日時 2023-08-24 00:04:15
合計ジャッジ時間 11,455 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 244 ms
9,036 KB
testcase_01 AC 825 ms
321,372 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 46 ms
26,424 KB
testcase_06 AC 550 ms
210,772 KB
testcase_07 AC 642 ms
225,480 KB
testcase_08 AC 649 ms
226,536 KB
testcase_09 AC 363 ms
156,112 KB
testcase_10 AC 152 ms
79,296 KB
testcase_11 AC 295 ms
135,380 KB
testcase_12 AC 296 ms
138,020 KB
testcase_13 AC 167 ms
86,484 KB
testcase_14 AC 53 ms
30,228 KB
testcase_15 AC 338 ms
152,016 KB
testcase_16 AC 234 ms
9,460 KB
testcase_17 AC 251 ms
11,128 KB
testcase_18 AC 246 ms
11,128 KB
testcase_19 AC 320 ms
145,468 KB
testcase_20 AC 501 ms
198,344 KB
testcase_21 AC 317 ms
144,500 KB
testcase_22 AC 11 ms
7,372 KB
testcase_23 AC 10 ms
7,476 KB
testcase_24 AC 3 ms
4,380 KB
testcase_25 AC 3 ms
4,376 KB
testcase_26 AC 5 ms
4,376 KB
testcase_27 AC 4 ms
4,380 KB
testcase_28 AC 3 ms
4,376 KB
testcase_29 AC 3 ms
4,376 KB
testcase_30 AC 10 ms
7,364 KB
testcase_31 AC 3 ms
4,376 KB
testcase_32 AC 11 ms
7,408 KB
testcase_33 AC 5 ms
4,836 KB
testcase_34 AC 5 ms
4,376 KB
testcase_35 AC 246 ms
7,080 KB
testcase_36 AC 261 ms
10,452 KB
testcase_37 AC 665 ms
234,120 KB
testcase_38 AC 243 ms
6,996 KB
testcase_39 AC 4 ms
4,520 KB
testcase_40 AC 3 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

bool s[20001][20001];

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<ll> x(n), y(n);
  rep(i, n)cin >> x[i] >> y[i];
  int res = 0;
  rep(i, n){
    bool ng = false;
    for(int l = x[i] - 20; l <= x[i] + 20; l++){
      if(ng)break;
      for(int r = y[i] - 20; r <= y[i] + 20; r++){
        if(ng)break;
        if(l < 0 || l > 20000 || r < 0 || r > 20000)continue;
        ll dis = (x[i] - l) * (ll)(x[i] - l) + (y[i] - r) * (ll)(y[i] - r);
        if(s[l][r] && dis < 400){
          ng = true;
          break;
        }
      }
    }
    if(!ng){
      res++;
      s[x[i]][y[i]] = true;
    }
  }
  cout << res << endl;
  return 0;
}
0