結果
問題 | No.459 C-VS for yukicoder |
ユーザー | chaemon |
提出日時 | 2016-12-10 00:50:33 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,991 bytes |
コンパイル時間 | 1,047 ms |
コンパイル使用メモリ | 90,672 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-06 13:48:50 |
合計ジャッジ時間 | 6,360 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 3 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | RE | - |
testcase_21 | AC | 26 ms
5,376 KB |
testcase_22 | AC | 23 ms
5,376 KB |
testcase_23 | AC | 24 ms
5,376 KB |
testcase_24 | AC | 10 ms
5,376 KB |
testcase_25 | AC | 6 ms
5,376 KB |
testcase_26 | AC | 6 ms
5,376 KB |
testcase_27 | AC | 6 ms
5,376 KB |
testcase_28 | AC | 5 ms
5,376 KB |
testcase_29 | AC | 10 ms
5,376 KB |
testcase_30 | AC | 6 ms
5,376 KB |
testcase_31 | AC | 6 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | RE | - |
testcase_34 | AC | 8 ms
5,376 KB |
testcase_35 | AC | 3 ms
5,376 KB |
testcase_36 | AC | 8 ms
5,376 KB |
testcase_37 | AC | 3 ms
5,376 KB |
testcase_38 | RE | - |
testcase_39 | AC | 3 ms
5,376 KB |
testcase_40 | AC | 7 ms
5,376 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 7 ms
5,376 KB |
testcase_43 | AC | 8 ms
5,376 KB |
testcase_44 | RE | - |
testcase_45 | AC | 3 ms
5,376 KB |
testcase_46 | AC | 4 ms
5,376 KB |
testcase_47 | AC | 3 ms
5,376 KB |
testcase_48 | AC | 8 ms
5,376 KB |
testcase_49 | AC | 3 ms
5,376 KB |
testcase_50 | RE | - |
testcase_51 | AC | 3 ms
5,376 KB |
testcase_52 | RE | - |
testcase_53 | AC | 3 ms
5,376 KB |
testcase_54 | RE | - |
testcase_55 | AC | 4 ms
5,376 KB |
testcase_56 | AC | 6 ms
5,376 KB |
testcase_57 | AC | 3 ms
5,376 KB |
testcase_58 | AC | 9 ms
5,376 KB |
testcase_59 | RE | - |
testcase_60 | RE | - |
コンパイルメッセージ
main.cpp: In function 'IO& operator<<(IO&, const std::string&)': main.cpp:74:1: warning: no return statement in function returning non-void [-Wreturn-type] 74 | } | ^
ソースコード
// #includes {{{ #include <algorithm> #include <numeric> #include <iostream> #include <string> #include <vector> #include <queue> #include <deque> #include <stack> #include <set> #include <map> #include <cstdio> #include <cstdlib> #include <cassert> #include <cstring> #include <cmath> using namespace std; // }}} // pre-written code {{{ #define REP(i,n) for(int i=0;i<(int)(n);++i) #define RREP(i,a,b) for(int i=(int)(a);i<(int)(b);++i) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) //#define IFOR(i,it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();++it,++i) #define ALL(c) (c).begin(), (c).end() #define MP make_pair //#define PB push_back #define CLEAR(c,d) memset((c),(d),sizeof(c)) #define TO_STRING(VariableName) # VariableName //#define DB(c) cout<<TO_STRING(c)<<"="<<(c)<<endl #define EXIST(e,s) ((s).find(e)!=(s).end()) #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; #define debug2(x) cerr << #x << " = [";REP(__ind,(x).size()){cerr << (x)[__ind] << ", ";}cerr << "] (L" << __LINE__ << ")" << endl; #define clr(a) memset((a),0,sizeof(a)) #define nclr(a) memset((a),-1,sizeof(a)) #define pb push_back typedef long long Int; typedef unsigned long long uInt; typedef long double rn; typedef pair<int,int> pii; //{{{ io struct IO{ }io;//dummy #define endl "\n" IO& operator>>(IO &io,int &n){scanf("%d",&n);return io;} IO& operator>>(IO &io,unsigned int &n){scanf("%u",&n);return io;} IO& operator>>(IO &io,long long &n){scanf("%lld",&n);return io;} IO& operator>>(IO &io,unsigned long long &n){scanf("%llu",&n);return io;} IO& operator>>(IO &io,double &n){scanf("%lf",&n);return io;} IO& operator>>(IO &io,long double &n){scanf("%Lf",&n);return io;} IO& operator>>(IO &io,char *c){scanf("%s",c);return io;} IO& operator>>(IO &io,string &s){ char c;s.clear(); while(isspace(c=getc(stdin))){if(c==-1)return io;} do{ s.push_back(c); }while(!isspace(c=getc(stdin))); if(c!=-1)ungetc(c,stdin); return io; } IO& operator<<(IO &io,const int &n){printf("%d",n);return io;} IO& operator<<(IO &io,const unsigned int &n){printf("%u",n);return io;} IO& operator<<(IO &io,const long long &n){printf("%lld",n);return io;} IO& operator<<(IO &io,const unsigned long long &n){printf("%llu",n);return io;} IO& operator<<(IO &io,const double &n){printf("%lf",n);return io;} IO& operator<<(IO &io,const long double &n){printf("%Lf",n);return io;} IO& operator<<(IO &io,const char c[]){printf("%s",c);return io;} IO& operator<<(IO &io,const string &s){ REP(i,s.size())putc(s[i],stdout); } //}}} // }}} int ct[10010],bl[10010],C[30010],ans[30010][3]; vector<pii> v; int main(){ int H,W,N; cin>>H>>W>>N; memset(ct,0,sizeof(ct)); memset(ans,0,sizeof(ans)); memset(bl,0,sizeof(bl)); string S; REP(i,H){ cin>>S; REP(j,W)if(S[j]=='#')ct[j]++; } REP(i,N){ int c; cin>>c; v.push_back(make_pair(c,i)); bl[c]++,bl[c+1]++,bl[c+2]++; } sort(C,C+N); /* REP(i,W)cout<<ct[i]<<" "; cout<<endl; */ REP(i,N){ int c = v[i].first; int p = 0; bl[c]--;bl[c+1]--;bl[c+2]--; REP(j,3){ int t = c+j; assert(ct[t]<=bl[t]*3+3); if(ct[t]>=bl[t]*3+1){ ans[v[i].second][j]=ct[t]-bl[t]*3; }else{ ans[v[i].second][j]=0; } ct[t]-=ans[v[i].second][j]; p+=ans[v[i].second][j]; } if(p==0){ REP(j,3){ int t = c+j; if(ct[t]>0){ ans[v[i].second][j]++; ct[t]--; break; } if(j==2)assert(false); } } /* cout<<"ans: "; REP(j,3)cout<<ans[i][j]<<" "; cout<<endl; REP(j,W)cout<<ct[j]<<" "; cout<<endl; REP(j,W)cout<<bl[j]<<" "; cout<<endl; */ } /* REP(ct,N){ REP(i,3)cout<<ans[ct][i]<<" "; cout<<endl; } */ REP(ct,N){ REP(i,3){ REP(j,3){ if(i<ans[ct][j]){ cout<<"#"; }else{ cout<<"."; } } cout<<endl; } } return 0; }