제출 #928622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928622		jpfr12	ZigZag (COCI17_zigzag)	C++17	80 / 80	59 ms	12912 KiB

zigzag

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
int MOD = (int)1e9+7;
int MAXN = 1e6;
 
//classes
 
 
 
//global
int n, m;
map<char, vector<string>> Map;
vector<int> total(26, 0);
vector<int> pos(26, 0);

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("longpath.in");
  //ofstream fout("longpath.out");
  //stop
  cin >> n >> m;
  vector<string> names(n);
  for(string& i: names){
    cin >> i;
    total[i[0]-'a']++;
  }
  sort(names.begin(), names.end());
  for(string& i: names){
    Map[i[0]].push_back(i);
  }
  for(int i = 0; i < m; i++){
    char c;
    cin >> c;
    cout << Map[c][pos[c-'a']] << '\n';
    pos[c-'a']++;
    pos[c-'a'] %= total[c-'a'];
  }
  return 0;
} 

• Subtask 1: 80 / 80