Submission #821837
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
#define ll long long
#define ull unsigned ll
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}
char memarr[17000000]; void *mem = memarr;
#define MD 1000000007
int N;
int As[1000], Bs[1000];
char A[1000][1100], B[1000][1100];
int mat[26][26];
int deg[26];
priority_queue<int> q;
int ress, res[26];
int main(){
int i, j, k, mx;
reader(&N);
rep(i,N){
As[i] = reader(A[i]);
Bs[i] = reader(B[i]);
}
rep(i,N){
mx = min(As[i], Bs[i]);
rep(j,mx) if(A[i][j] != B[i][j]) break;
if(j==mx){
if(j==Bs[i]){ writerLn("-1"); return 0; }
continue;
}
mat[A[i][j]-'a'][B[i][j]-'a'] = 1;
}
rep(k,26) rep(i,26) rep(j,26) mat[i][j] |= mat[i][k]&mat[k][j];
rep(i,26) if(mat[i][i]){
writerLn("-1");
return 0;
}
rep(i,26) rep(j,26) if(mat[i][j]) deg[j]++;
rep(i,26) if(deg[i]==0) q.push(-i);
while(q.size()){
i = -q.top();
q.pop();
res[ress++] = i;
rep(j,26) if(mat[i][j]){
deg[j]--;
if(deg[j]==0) q.push(-j);
}
}
rep(i,ress) mypc(res[i]+'a');
mypc('\n');
return 0;
}
Submission Info
Submission Time
2016-07-30 21:05:51+0900
Task
C - 山田山本問題
User
LayCurse
Language
C++14 (GCC 5.4.1)
Score
600
Code Size
3106 Byte
Status
AC
Exec Time
17 ms
Memory
2432 KB
Compile Error
./Main.cpp: In function ‘void reader(double*)’:
./Main.cpp:15:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void reader(double *x){scanf("%lf",x);}
^
Judge Result
Set Name
All
Score / Max Score
600 / 600
Status
Set Name
Test Cases
All
00_sample_01, 00_sample_02, 00_sample_03, 00_sample_04, 01_manual_00, 01_manual_01, 01_manual_02, 01_manual_03, 01_manual_04, 01_manual_05, 01_manual_06, 01_manual_07, 10_random_00, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 30_random_00, 30_random_01, 30_random_02, 30_random_03, 30_random_04, 30_random_05, 30_random_06, 30_random_07, 30_random_08, 30_random_09, 50_random_00, 50_random_01, 50_random_02, 50_random_03, 50_random_04, 50_random_05, 50_random_06, 50_random_07, 50_random_08, 50_random_09, 51_random_00, 51_random_01, 51_random_02
Case Name
Status
Exec Time
Memory
00_sample_01
AC
4 ms
256 KB
00_sample_02
AC
4 ms
256 KB
00_sample_03
AC
4 ms
256 KB
00_sample_04
AC
4 ms
256 KB
01_manual_00
AC
4 ms
256 KB
01_manual_01
AC
4 ms
256 KB
01_manual_02
AC
4 ms
256 KB
01_manual_03
AC
4 ms
256 KB
01_manual_04
AC
4 ms
256 KB
01_manual_05
AC
4 ms
256 KB
01_manual_06
AC
4 ms
256 KB
01_manual_07
AC
17 ms
2432 KB
10_random_00
AC
5 ms
384 KB
10_random_01
AC
4 ms
512 KB
10_random_02
AC
5 ms
512 KB
10_random_03
AC
4 ms
384 KB
10_random_04
AC
5 ms
384 KB
10_random_05
AC
5 ms
384 KB
10_random_06
AC
5 ms
512 KB
10_random_07
AC
5 ms
512 KB
10_random_08
AC
4 ms
256 KB
10_random_09
AC
5 ms
384 KB
30_random_00
AC
4 ms
384 KB
30_random_01
AC
4 ms
256 KB
30_random_02
AC
4 ms
256 KB
30_random_03
AC
4 ms
256 KB
30_random_04
AC
5 ms
384 KB
30_random_05
AC
4 ms
384 KB
30_random_06
AC
4 ms
256 KB
30_random_07
AC
4 ms
384 KB
30_random_08
AC
4 ms
384 KB
30_random_09
AC
4 ms
512 KB
50_random_00
AC
15 ms
2176 KB
50_random_01
AC
14 ms
2176 KB
50_random_02
AC
17 ms
2432 KB
50_random_03
AC
16 ms
2304 KB
50_random_04
AC
14 ms
2048 KB
50_random_05
AC
16 ms
2304 KB
50_random_06
AC
14 ms
2048 KB
50_random_07
AC
16 ms
2432 KB
50_random_08
AC
15 ms
2048 KB
50_random_09
AC
15 ms
2432 KB
51_random_00
AC
16 ms
2432 KB
51_random_01
AC
14 ms
2048 KB
51_random_02
AC
15 ms
2176 KB