結果
問題 | No.202 1円玉投げ |
ユーザー | mai |
提出日時 | 2017-07-09 11:53:39 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 81 ms / 5,000 ms |
コード長 | 3,877 bytes |
コンパイル時間 | 3,220 ms |
コンパイル使用メモリ | 224,316 KB |
実行使用メモリ | 39,864 KB |
最終ジャッジ日時 | 2023-08-23 23:33:24 |
合計ジャッジ時間 | 6,518 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
31,456 KB |
testcase_01 | AC | 72 ms
39,864 KB |
testcase_02 | AC | 15 ms
27,740 KB |
testcase_03 | AC | 15 ms
27,800 KB |
testcase_04 | AC | 15 ms
27,760 KB |
testcase_05 | AC | 18 ms
28,712 KB |
testcase_06 | AC | 68 ms
36,556 KB |
testcase_07 | AC | 75 ms
37,216 KB |
testcase_08 | AC | 76 ms
37,228 KB |
testcase_09 | AC | 49 ms
33,540 KB |
testcase_10 | AC | 28 ms
30,324 KB |
testcase_11 | AC | 41 ms
32,548 KB |
testcase_12 | AC | 43 ms
32,668 KB |
testcase_13 | AC | 29 ms
30,576 KB |
testcase_14 | AC | 18 ms
28,660 KB |
testcase_15 | AC | 46 ms
33,328 KB |
testcase_16 | AC | 49 ms
32,396 KB |
testcase_17 | AC | 56 ms
32,404 KB |
testcase_18 | AC | 55 ms
32,476 KB |
testcase_19 | AC | 44 ms
33,004 KB |
testcase_20 | AC | 62 ms
35,940 KB |
testcase_21 | AC | 45 ms
33,000 KB |
testcase_22 | AC | 16 ms
27,884 KB |
testcase_23 | AC | 15 ms
27,812 KB |
testcase_24 | AC | 15 ms
27,752 KB |
testcase_25 | AC | 16 ms
27,740 KB |
testcase_26 | AC | 16 ms
27,820 KB |
testcase_27 | AC | 16 ms
27,832 KB |
testcase_28 | AC | 15 ms
27,760 KB |
testcase_29 | AC | 15 ms
27,780 KB |
testcase_30 | AC | 15 ms
27,904 KB |
testcase_31 | AC | 15 ms
27,772 KB |
testcase_32 | AC | 16 ms
27,876 KB |
testcase_33 | AC | 16 ms
27,832 KB |
testcase_34 | AC | 16 ms
27,784 KB |
testcase_35 | AC | 57 ms
31,528 KB |
testcase_36 | AC | 57 ms
31,360 KB |
testcase_37 | AC | 81 ms
38,040 KB |
testcase_38 | AC | 58 ms
31,340 KB |
testcase_39 | AC | 15 ms
27,768 KB |
testcase_40 | AC | 16 ms
27,836 KB |
コンパイルメッセージ
main.cpp: メンバ関数 ‘{無名}::MaiScanner& {無名}::MaiScanner::operator>>(std::string&)’ 内: main.cpp:62:9: 警告: 非 void を戻す関数内に return 文がありません [-Wreturn-type] 62 | } | ^
ソースコード
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}} #define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}} #define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(l) for(auto cnt=0;cnt<(l);++cnt) #define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } mt19937 mt(8901016); inline int rand_int(int l, int h) { return uniform_int_distribution<>(l, h)(mt); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiablechar(cc); cc = getchar_unlocked()); for (; isvisiablechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; int n; vector<int> aa; vector<int> field[1020][1020]; vector<pair<int, int>> thrown; bool iscrashed(ll px, ll py, ll qx, ll qy) { //printf("%d %d %d %d\n",px,py,qx,py); //cout << (px - qx)*(px - qx) + (py - qy)*(py - qy) << endl; return (px - qx)*(px - qx) + (py - qy)*(py - qy) < 400; } int main() { scanner >> n; int count = 0; repeat(n) { int x, y, cx, cy; scanner >> x >> y; cx = x / 20; cy = y / 20; set<int> conflicted; for (int i : field[cx][cy]) conflicted.insert(i); for (int i : field[cx+1][cy]) conflicted.insert(i); for (int i : field[cx][cy+1]) conflicted.insert(i); for (int i : field[cx+1][cy+1]) conflicted.insert(i); for (int i : conflicted) { if (iscrashed(thrown[i].first, thrown[i].second, x, y)) goto l_next; } field[cx][cy].push_back(count); field[cx+1][cy].push_back(count); field[cx][cy+1].push_back(count); field[cx+1][cy+1].push_back(count); thrown.emplace_back(x, y); ++count; l_next:; } cout << count << endl; return 0; }