【题解】2021 年第十三届四川省 ACM-ICPC 大学生程序设计竞赛（重现赛）

忘是亡心i 2022-10-06 15:52 244阅读 0赞

[codeforces][]  
[牛客][Link 1]

A Chuanpai

--------------------

H Nihongo wa Muzukashii D

#include <iostream>
    #include <algorithm>
    #include <string>
    #include <string.h>
    #include <cstring>
    #include <queue>
    #include <map>
    #include <unordered_map>
    #include <set>
    #include <unordered_set>
    #include <stack>
    #include <math.h>
    #include <limits.h>
    #include <stdio.h>
    #include <vector>
    #include <bitset>
    #include <deque>
    #include <functional>
    #include <ctype.h>
    #include <sstream>
    
    using namespace std;
    #pragma warning(disable:4996)
    
    const double eps = 1e-6;
    typedef long long ll;
    #define debug(x) cout<<#x<<": "<<(x)<<endl;
    #define lfeq(a,b) (abs((a)-(b)) < eps)
    
    int mod = 1e9 + 7;
    int inf = 0x3f3f3f3f;
    const double pi = acos(-1.0);
    
    bool sol() { 
    
        vector<vector<string>> a = { 
            {  "chimasu","rimasu",/*"imasu",*/ },
            {  "mimasu", "bimasu","nimasu"},
            {   "kimasu" },
            {   "gimasu" },
            {   "shimasu" },
        };
    
        string s;
        cin >> s;
        int i = 0;
        int j = 0;
        if (s == "ikimasu") { 
            cout << "itte" << endl;
            return true;
        }
        vector<string> arr = {  "tte","nde","ite","ide","shite" };
        
    
        for (i = 0; i < a.size(); ++i) { 
            for (j = 0; j < a[i].size(); ++j) { 
                int pos = s.rfind(a[i][j]);
                if (pos != string::npos) { 
    
                    s = s.substr(0,pos);
                    s += arr[i];
                    cout << s << endl;
                    return true;
                }
            }
        }
    
        
    
        return true;
    }
    
    int main() { 
    
        //freopen("../in1.txt", "r", stdin);
        int  t = 0;
        cin >> t;
        for (int i = 0; i < t; ++i) { 
            sol();
        }
        return 0;
    }

K K-skip Permutation

--------------------

M True Story

#include <iostream>
    #include <algorithm>
    #include <string>
    #include <string.h>
    #include <cstring>
    #include <queue>
    #include <map>
    #include <unordered_map>
    #include <set>
    #include <unordered_set>
    #include <stack>
    #include <math.h>
    #include <limits.h>
    #include <stdio.h>
    #include <vector>
    #include <bitset>
    #include <deque>
    #include <functional>
    #include <ctype.h>
    #include <sstream>
    
    using namespace std;
    #pragma warning(disable:4996)
    
    const double eps = 1e-6;
    typedef long long ll;
    #define debug(x) cout<<#x<<": "<<(x)<<endl;
    #define lfeq(a,b) (abs((a)-(b)) < eps)
    
    int mod = 1e9 + 7;
    int inf = 0x3f3f3f3f;
    const double pi = acos(-1.0);
    
    int s[100001];
    int t[100001];
    int p[100001];
    
    int main() { 
    
        //freopen("./in1.txt", "r", stdin);
        int n, k, x, p0;
        cin >> n >> k >> x >> p0;
        for (int i = 0; i < n; ++i) { 
            cin >> s[i];
        }
    
        for (int i = 0; i < k; ++i) { 
            cin >> t[i];
        }
    
        for (int i = 0; i < k; ++i) { 
            cin >> p[i];
        }
        sort(s,s+n,greater<int>());
        int i = 0;
    
        while (i<n){ 
            if (p0 * s[i] >= x) { 
                i++;
            }
            else { 
                break;
            }
        }
        
        for (int kk = 0; kk < k; ++kk) { 
            while ( i<n && (p[kk] - t[kk]) * s[i] >= x) { 
                i++;
            }
        }
        cout << i << endl;
        return 0;
    }

[codeforces]: https://codeforces.com/gym/103117
[Link 1]: https://ac.nowcoder.com/acm/contest/17624#question