DMOPC '20 Contest 2 P1 - Laugh Graphs

    1#include <bits/stdc++.h>
    2 
    3using namespace std;
    4 
    5int main(){
    6    ios::sync_with_stdio(0);
    7    cin.tie(0);
    8    int n; 
    9    cin >> n;
    10    string s; 
    11    cin >> s;
    12    unordered_map<int, vector<pair<int,char>>> rows;
    13    int r = 0, c = 0;
    14    int minR = 0, maxR = 0, maxC = 0;
    15    auto add = [&](int row, int col, char ch){
    16        rows[row].push_back({col, ch});
    17        maxC = max(maxC, col);
    18    };
    19    for(char p : s) {
    20        if(p == '^'){
    21            add(r, c, '/');    
    22            c++; r--;      
    23        } else if(p == 'v'){
    24            r++;            
    25            add(r, c, '\\');   
    26            c++;              
    27        } else {        
    28            add(r, c, '_');
    29            c++;
    30        }
    31        minR = min(minR, r);
    32        maxR = max(maxR, r);
    33    }
    34    for (int row = minR; row <= maxR; row++){
    35        auto &vec = rows[row];
    36        if (vec.empty()) continue;
    37        string line;
    38        int cur = 0;
    39        for (auto [col, ch] : vec){
    40            line.append(col - cur, '.');
    41            line.push_back(ch);
    42            cur = col + 1;
    43        }
    44        line.append(n - line.size(), '.'); 
    45        cout << line << '\n';
    46    }
    47    
    48    return 0;
    49}
    50