oj.uz

Submission #91159

# Submission time Handle Problem Language Result Execution time Memory
91159 2018-12-26T12:23:10 Z nikolapesic2802 Cezar (COCI16_cezar) C++14
0 / 100
 2 ms 632 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a) {
	os << '{';
	for(int i=0;i<sz(a);i++)
	{
		if(i>0&&i<sz(a))
			os << ", ";
		os << a[i];
	}
	os << '}';
    return os;
}
const int N=26;
vector<vector<int> > graf(N);
vector<int> visited(N);
void dfs(int tr)
{
    visited[tr]=1;
    for(auto p:graf[tr])
    {
        if(visited[p]==1)
        {
            printf("NE\n");
            exit(0);
        }
        if(visited[p]==0)
            dfs(p);
    }
    visited[tr]=2;
}
int main()
{
	int n;
	scanf("%i",&n);
    vector<pair<int,string> > niz(n);
    for(int i=0;i<n;i++)
        cin >> niz[i].second;
    for(int i=0;i<n;i++)
        scanf("%i",&niz[i].first);
    sort(all(niz));
    for(int i=1;i<n;i++)
    {
        for(int j=0;j<i;j++)
        {
            int si=niz[i].s.size();
            int sj=niz[j].s.size();
            if(si<sj)
            {
                if(niz[j].s.substr(0,si)==niz[i].s)
                {
                    printf("NO\n");
                    return 0;
                }
            }
        }
    }
    for(int i=1;i<n;i++)
    {
        bool nasao=true;
        for(int j=0;j<min(niz[i].second.size(),niz[i-1].second.size());j++)
        {
            if(niz[i].s[j]!=niz[i-1].s[j])
            {
                graf[niz[i-1].s[j]-'a'].pb(niz[i].s[j]-'a');
                nasao=false;
                break;
            }
        }
        if(nasao)
        {
            if(niz[i].s.size()<niz[i-1].s.size())
            {
                printf("NE\n");
                return 0;
            }
        }
    }
    /*for(int i=0;i<N;i++)
    {
        fill(all(visited),1);
        dfs(i);
    }*/
    int tr=0;
    vector<int> degree(N);
    for(int i=0;i<N;i++)
    {
        for(auto p:graf[i])
        {
            degree[p]++;
        }
    }
    vector<int> sol(N,-1);
    for(int i=0;i<N;i++)
    {
        bool ima=false;
        for(int j=0;j<N;j++)
        {
            if(degree[j]==0)
            {
                sol[j]=tr;
                tr++;
                ima=true;
                for(auto p:graf[j])
                {
                    degree[p]--;
                }
                degree[j]=INT_MAX;
                break;
            }
        }
        if(!ima)
        {
            printf("NE\n");
            return 0;
        }
    }
    printf("DA\n");
    for(int i=0;i<N;i++)
    {
        printf("%c",sol[i]+'a');
    }
    printf("\n");
    return 0;
}

Compilation message

cezar.cpp: In function 'int main()':
cezar.cpp:78:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<min(niz[i].second.size(),niz[i-1].second.size());j++)
                     ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cezar.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
cezar.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&niz[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Incorrect 2 ms 588 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Incorrect 2 ms 588 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -