Submission #3424995
Source Code Expand
///////////////////////////////////////////////////////// // // c/temp.cpp file // Last Updated: 2018-08-07 ...Maybe // // I hope you adding this code to the setting file // alias g++='g++ -std=c++1y -DDEBUG_LOCAL' // ///////////////////////////////////////////////////////// #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define mp make_pair #define pb push_back //#define int long long #define _overload3(_1,_2,_3,name,...) name #define _REP(i,n) REAP(i,0,n) #define REAP(i,a,b) for(int i=int(a);i<int(b);++i) #define REP(...) _overload3(__VA_ARGS__,REAP,_REP,)(__VA_ARGS__) #define _REPR(i,n) REAPR(i,n,0) #define REAPR(i,a,b) for(int i=int(a-1);i>=int(b);--i) #define REPR(...) _overload3(__VA_ARGS__,REAPR,_REPR,)(__VA_ARGS__) #define ALL(a) a.begin(),a.end() #define rALL(a) a.rbegin(),a.rend() #define coutALL(a) {int loop_coutALL=0;for(auto e:a) cout<<(loop_coutALL++?" ":"")<<e; cout<<endl;} #define coutYN(a) cout<<((a)?"YES":"NO")<<endl; #define coutYn(a) cout<<((a)?"Yes":"No")<<endl; #define coutyn(a) cout<<((a)?"yes":"no")<<endl; #define pcnt __builtin_popcount #define buli(x) __builtin_popcountll(x) const int INF=1145141919; const int MOD=(int)1e9+7; const double EPS=1e-12; const int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; //const int dx[]={-1,-1,-1,0,1,1,1,0},dy[]={-1,0,1,1,1,0,-1,-1}; using vi=vector<int>; using vvi=vector<vi>; using vs=vector<string>; typedef pair<int,int> pii; typedef pair<int,string> pis; typedef pair<string,int> psi; typedef pair<string,string> pss; typedef long long ll; template<typename T> istream &operator >> (istream &is, vector<T> &v){for(T &x:v) is>>x;return is;} template<typename T> ostream &operator << (ostream &os, vector<T> &v){int i=0;for(T &x:v) os<<(i++?" ":"")<<x;return os;} ll rev(ll n){ll x=0;for(;n>0;){x=x*10+n%10;n/=10;}return x;} template<class T> ll upper(T n,T m){return (n+m-1)/m;}; template<class T> ll rounding(T n){return (long double)n+0.5;}; template<class T> bool inG(T x,T n){return 0<=x && 0<n;} template<class T> bool outG(T x,T n){return x<0 || n<=x;} inline int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a;a=1ll*a*a;}while(b>>=1);return ans;} inline int qp(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;} inline ll fac(ll k,ll n){ll a=1;for(int i=0;i<n;i++)a*=k--;return a;} inline ll fac(ll k,ll n,int mo){ll a=1;for(int i=0;i<n;i++)a*=k--,a%=mo;return a;} struct Arithmetic{Arithmetic(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}; //#define DEBUG_LOCAL #ifdef DEBUG_LOCAL template<typename T> void deb(T a){cerr<<"deb: "<<a<<"です"<<endl;} #define debl {cerr<<"debug: "<<__LINE__<<"行目だ"<<endl;} void what_cr(){cout<<__GCC_ATOMIC_CHAR16_T_LOCK_FREE<<" ←?"<<endl;} //ori_func S //ori_func E #else template<typename T>void deb(T a){} #define debl void what_cr(){}void t_t(){} #endif signed main(){ Arithmetic Exception; int n; cin>>n; vector <char> a[9]; REP(i,n){ string s; cin>>s; REP(j,9) a[j].pb(s[j]); } int ans=0; REP(cnt,9){ REP(i,n){ if (a[cnt][i] == 'x') ans++; else if(a[cnt][i] == 'o'){ ans++; for(;i<n && a[cnt][i] == 'o';i++); i--; } } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 音楽ゲーム |
User | Lilly |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 3432 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt, test_71.txt, test_72.txt, test_73.txt, test_74.txt, test_75.txt, test_76.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 2 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 1 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |
test_36.txt | AC | 1 ms | 256 KB |
test_37.txt | AC | 1 ms | 256 KB |
test_38.txt | AC | 1 ms | 256 KB |
test_39.txt | AC | 1 ms | 256 KB |
test_40.txt | AC | 1 ms | 256 KB |
test_41.txt | AC | 1 ms | 256 KB |
test_42.txt | AC | 1 ms | 256 KB |
test_43.txt | AC | 1 ms | 256 KB |
test_44.txt | AC | 1 ms | 256 KB |
test_45.txt | AC | 1 ms | 256 KB |
test_46.txt | AC | 1 ms | 256 KB |
test_47.txt | AC | 1 ms | 256 KB |
test_48.txt | AC | 1 ms | 256 KB |
test_49.txt | AC | 1 ms | 256 KB |
test_50.txt | AC | 1 ms | 256 KB |
test_51.txt | AC | 1 ms | 256 KB |
test_52.txt | AC | 1 ms | 256 KB |
test_53.txt | AC | 1 ms | 256 KB |
test_54.txt | AC | 1 ms | 256 KB |
test_55.txt | AC | 1 ms | 256 KB |
test_56.txt | AC | 1 ms | 256 KB |
test_57.txt | AC | 1 ms | 256 KB |
test_58.txt | AC | 1 ms | 256 KB |
test_59.txt | AC | 1 ms | 256 KB |
test_60.txt | AC | 1 ms | 256 KB |
test_61.txt | AC | 1 ms | 256 KB |
test_62.txt | AC | 1 ms | 256 KB |
test_63.txt | AC | 1 ms | 256 KB |
test_64.txt | AC | 1 ms | 256 KB |
test_65.txt | AC | 1 ms | 256 KB |
test_66.txt | AC | 1 ms | 256 KB |
test_67.txt | AC | 1 ms | 256 KB |
test_68.txt | AC | 1 ms | 256 KB |
test_69.txt | AC | 1 ms | 256 KB |
test_70.txt | AC | 1 ms | 256 KB |
test_71.txt | AC | 1 ms | 256 KB |
test_72.txt | AC | 1 ms | 256 KB |
test_73.txt | AC | 1 ms | 256 KB |
test_74.txt | AC | 1 ms | 256 KB |
test_75.txt | AC | 1 ms | 256 KB |
test_76.txt | AC | 1 ms | 256 KB |