CCF 201509-3 模板生成系统 (STL+模拟)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const LL LNF = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e4 + 5;
const int mod = 1e9 + 7;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}
vector<string> text;

int main(){
    while(scanf("%d %d", &n, &m) == 2){
        getchar();
        string line;
        text.clear();
        for(int i = 0; i < n; ++i){
            getline(cin, line);
            text.push_back(line);
        }

        int pos;
        while(m--){
            string s1, s2;
            getline(cin, line);
            pos = line.find(" ");
            s1 = line.substr(0, pos);
            s2 = line.substr(pos+2, (int)line.size()-pos-3);

            for(int i = 0; i < n; ++i){
                string &s = text[i];
                pos = 0;
                while(true){
                    int pos1 = s.find("{{ ", pos);
                    int pos2 = s.find(" }}" , pos1);
                    if(pos1 < 0 || pos2 < 0)  break;
                    string t = s.substr(pos1+3, pos2-pos1-3);
                    if(t == s1)  s.replace(pos1, pos2-pos1+3, s2, 0, s2.size());
                    pos = pos1+s2.size();
                }
            }
        }

        for(int i = 0; i < n; ++i){
            string &s = text[i];
            pos = 0;
            while(true){
                int pos1 = s.find("{{ ", pos);
                int pos2 = s.find(" }}", pos1);
                if(pos1 < 0 || pos2 < 0)  break;
                s.replace(pos1, pos2-pos1+3, "", 0, 0);
                pos = pos1;
            }
        }
        for(int i = 0; i < n; ++i)
            cout << text[i] << endl;
    }
    return 0;
}