Submission #43050
ソースコード
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | // -YDK- {{{ #include <functional> #include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include <sstream> #include <numeric> #include <string> #include <cstdio> #include <vector> #include <tuple> #include <cmath> #include <queue> #include <regex> #include <set> #include <map> using namespace std; #define eb emplace_back #define emp emplace #define fi first #define se second #define debug(...) fprintf(stderr, __VA_ARGS__ ) #define outl(x) cout << (x) << '\n' #define outl2(x,y) cout << (x) << ' ' << (y) << '\n' #define endl '\n' #define rep(i,n) for(int i=0; i<(int)(n); ++i) #define ALL(x) x.begin(), x.end() #define YES(f,y,n) cout << ((f)? (#y):(#n)) << '\n' #define ODD(n) ((n)&1) #define EVEN(n) (!ODD(n)) #define _ ' ' #define $ '\n' #define __YDK__ namespace ydk { #define __END__ } __YDK__ template < class A, class B> inline bool chmax(A &a, B b){ return b>a ? a=b,1 : 0;} template < class A, class B> inline bool chmin(A &a, B b){ return b<a ? a=b,1 : 0;} template < class T> using MaxHeap = priority_queue< T, vector<T>, greater<T> >; using ll = long long ; using pii = pair< int , int >; using byte= unsigned char ; inline bool inside( int x, int y, int W, int H) { return x>=0 && y>=0 && x<W && y<H; } constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr int dx[] = {1, 0, -1, 0}; constexpr int dy[] = {0, 1, 0, -1}; struct Point: public pii { int &x = this ->first, &y = this ->second; Point( int x, int y): pii(x, y) {} }; struct Writer { static constexpr size_t BUFF_SIZE = 1 << 18; static char _buf[BUFF_SIZE]; explicit Writer() { setvbuf (stdout, _buf, _IOFBF, sizeof (_buf)); } inline void ln() { putchar ( '\n' );} inline Writer& put( int n) { printf ( "%d" , n); return * this ;} inline Writer& put(ll n) { printf ( "%lld" , n); return * this ;} inline Writer& put( char c) { printf ( "%c" , c); return * this ;} inline Writer& put( double d){ printf ( "%lf" , d); return * this ;} inline Writer& put( const char * s){ printf ( "%s" , s); return * this ;} inline Writer& put( const string &s){ printf ( "%s" , s.c_str()); return * this ;} inline Writer& put( bool f) { printf ( "%s" , f? "true" : "false" ); return * this ;} }; char Writer::_buf[BUFF_SIZE]; template < class T> inline Writer& operator < (Writer &o, const T &v) { return o.put(v); } struct Scanner { char tmp[1024]; inline Scanner& read( int &n) { scanf ( "%d" , &n); return * this ;} inline Scanner& read(ll &n) { scanf ( "%lld" , &n); return * this ;} inline Scanner& read( char &c) { scanf ( " %c" , &c); return * this ;} inline Scanner& read( double &d) { scanf ( "%lf" , &d); return * this ;} inline Scanner& read( char *s) { scanf ( "%s" , s); return * this ;} inline Scanner& read(string &s) { scanf ( "%s" ,tmp); s=string(tmp); return * this ;} }; template < class T> inline Scanner& operator > (Scanner &in, T &v) { return in.read(v); } template < class T> inline Scanner& operator , (Scanner &in, T &v) { return in.read(v); } Writer out; Scanner in; __END__ // }}} __YDK__ constexpr int LIM = ( int )1e5 + 5; signed main( void ) { return 0; } __END__ signed main( void ) { return ydk::main(); } |
ステータス
項目 | データ |
---|---|
問題 | 0826 - Kitty! |
ユーザー名 | Arumakan_ei1727 |
投稿日時 | 2018-09-13 17:22:05 |
言語 | C++17 |
状態 | Accepted |
得点 | 1 |
ソースコード長 | 3230 Byte |
最大実行時間 | 3 ms |
最大メモリ使用量 | 0 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 1 / 1 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
Kitty | AC | 3 ms | 0 KB |
1
|