# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373583 | Atill83 | ZigZag (COCI17_zigzag) | C++14 | 49 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;
set<string> num[MAXN][26];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
vector<set<int>> st(26);
cin>>k>>n;
for(int i = 0; i < k; i++){
string a;
cin>>a;
num[0][a[0] - 'a'].insert(a);
st[a[0] - 'a'].insert(0);
}
for(int i = 0; i < n; i++){
char c;
cin>>c;
int idx = c - 'a';
int x = *st[idx].begin();
string dis = (*num[x][idx].begin());
num[x][idx].erase(num[x][idx].begin());
if(num[x][idx].empty())
st[idx].erase(st[idx].begin());
st[idx].insert(x + 1);
cout<<(dis)<<endl;
num[x + 1][idx].insert(dis);
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |