oj.uz

Submission #1020272

# Submission time Handle Problem Language Result Execution time Memory
1020272 2024-07-11T18:57:36 Z ajay Kartomat (COCI17_kartomat) C++17
0 / 80
 1 ms 504 KB 
/* Ajay Jadhav */
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
 
 
#define ll          long long
#define pb          push_back
#define pii         pair<int,int>
#define vi          vector<int>
#define vii         vector<pii>
#define mi          map<int,int>
#define mii         map<pii,int>
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define rep(i,a,b)  for(int i=a;i<b;i++)
#define endl        '\n'
 
 
 
void solve()
{
    vector<string> a(4);
    a[0] = "***ABCDE";
    a[1] = "FGHIJKLM";
    a[2] = "NOPQRSTU";
    a[3] = "VWXYZ***";
    int n;
    cin>>n;
    vector<string> stations(n);
    rep(i,0,n)
    {
    	cin>>stations[i];
    } 
    string des;
    cin>>des;
    multiset<char> ms;
    rep(i,0,n)
    {
    	int c = 0;
    	rep(j,0,sz(des))
    	{
    		if (j < sz(stations[i]) and des[j] != stations[i][j])
    		{
    			break;
    		}
    		c++;
    	}
    	if (c > 0 and c < sz(stations[i]))
    	{
    		ms.insert(stations[i][c]);
    	}
    }

    for (char ch: ms)
    {
    	cout<<ch<<" ";
    }
    cout<<endl;

    rep(i, 0, 4)
    {
    	rep(j, 0, 8)
    	{
    		auto it = ms.find(a[i][j]);
    		if (it != ms.end())
    		{
    			ms.erase(it);
    		}
    		else
    		{
    			a[i][j] = '*';
    		}
    	}
    }

    rep(i,0,4)
    {
    	rep(j,0,8)
    	{
    		cout<<a[i][j];
    	}
    	cout<<endl;
    }

}
 
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 1 ms 504 KB Output isn't correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Incorrect 0 ms 348 KB Output isn't correct