Submission #447297

#	Time	Username	Problem	Language	Result	Execution time	Memory
447297		LptN21	ZigZag (COCI17_zigzag)	C++14	80 / 80	68 ms	7876 KiB

zigzag

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
#define all(a) (a).begin(), (a).end()
#define odd(x) __builtin_parity((int)x)
#define cntbit(x) __builtin_popcount(x)
typedef long long ll;
typedef pair<int, int> ii;
const int N = 26+7, M=20;
const int MOD = 998244353;
const int oo = 2e18+7;

int n, m, k, t;

vector<string> dict[N];
int nxtid[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    fastIO;
    //scanf("%d%d", &n, &m);
    cin>>n>>m;
    string s;
    for(int i=1;i<=n;i++) {
        //scanf("%s", &ch);
        cin>>s; dict[s[0]-'a'].pb(s);
    }
    for(int i=0;i<N;i++) sort(all(dict[i]));
    for(int i=1;i<=m;i++) {
        cin>>s; k=s[0]-'a';
        cout<<dict[k][nxtid[k]]<<"\n";
        nxtid[k]=(nxtid[k]+1)%sz(dict[k]);
    }
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message (stderr)

zigzag.cpp:18:20: warning: overflow in conversion from 'double' to 'int' changes value from '2.0e+18' to '2147483647' [-Woverflow]
   18 | const int oo = 2e18+7;
      |                ~~~~^~

• Subtask 1: 80 / 80