oj.uz

답안 #83452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
83452 2018-11-07T20:59:28 Z Genezio Cezar (COCI16_cezar) C++14
0 / 100
 1000 ms 464 KB 
#include<bits/stdc++.h>

using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define ll long long

const int N = 110;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9+7;

 string s[N];
 vector<int> v[30];
 int a[N];
 int deg[30];
 int ans[N];
 bool e[N][N];

int main() {
	//ios::sync_with_stdio(false);
 	//cin.tie(0);
    int n;
    int c=0;
    cin>>n;
    for(int i=0;i<n;i++) {
        cin>>s[i];
    }
    for(int i=0;i<n;i++) {
    	cin>>a[i];
    	a[i]--;
    }
    for(int i=0;i<n-1;i++) {
    	int idx=0;
    	while(true) {
    		if(s[a[i]][idx]==s[a[i+1]][idx]) {
    			if(s[a[i]].size()==idx+1) break;
    			if(s[a[i+1]].size()==idx+1) break;
    		} else {
    			if(!e[(int)(s[a[i]][idx]-'a')][(int)(s[a[i+1]][idx]-'a')]) { 
    				v[(int)(s[a[i]][idx]-'a')].push_back((int)(s[a[i+1]][idx]-'a'));
    				e[(int)(s[a[i]][idx]-'a')][(int)(s[a[i+1]][idx]-'a')]=true;
    			}
    			deg[(int)(s[a[i+1]][idx]-'a')]++;
    			break;
    		}
    	}
    }
    queue<int> q;
    for(int i=0;i<26;i++) {
    	if(!deg[i]) q.push(i);
    }
    while(q.size()) {
    	int at = q.front();
    	q.pop();
    	ans[at]=c;
    	c++;
    	//cout<<at<<"\n";
    	for(int i=0;i<v[at].size();i++) {
    		deg[v[at][i]]--;
    		//cout<<v[at][i]<<" "<<deg[v[at][i]]<<"\n";
    		if(!deg[v[at][i]]) q.push(v[at][i]);
    	}
    }
    if(c<26) {
    	cout<<"NE\n";
    } else {
    	cout<<"DA\n";
    	for(int i=0;i<26;i++) {
    		cout<<(char)(ans[i]+(int)('a'));
    	}
    	cout<<"\n";
    }
    return 0;
}

Compilation message

cezar.cpp: In function 'int main()':
cezar.cpp:39:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if(s[a[i]].size()==idx+1) break;
           ~~~~~~~~~~~~~~^~~~~~~
cezar.cpp:40:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if(s[a[i+1]].size()==idx+1) break;
           ~~~~~~~~~~~~~~~~^~~~~~~
cezar.cpp:61:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int i=0;i<v[at].size();i++) {
                  ~^~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1084 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1073 ms 388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1077 ms 444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1081 ms 444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1070 ms 456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1088 ms 464 KB Time limit exceeded
2 Halted 0 ms 0 KB -