7月22日补题

G题

G题模拟二分的过程，如果搜到的数值是自己要搜的则算能搜到，否则就是搜不到。这个题注意要使用long long类型来存储，使用int会答案错误。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_map>
#include <queue>
#include <cstring>

using namespace std;

typedef long long ll;

const ll N = 1e6 + 10;

ll n;
ll m, a, c;
ll cnt = 0;

ll x[N];
ll b[N];

ll bsearch_1(ll l, ll r, ll p)
{
    while (l < r)
    {
        ll mid = (l + r) / 2;
        if (x[mid] == p)
            return mid;
        if (x[mid] > p) r = mid - 1;
        else l = mid + 1;
    }
    return l;
}

int main(){
    cin >> n >> m >> a >> c >> x[0];
    for (ll i = 1; i <= n; i ++){
        x[i] = ((a % m) * (x[i - 1] % m ) % m + c % m) % m;
    }
//     for (ll i = 1; i <= n; i ++)
//         cout << x[i] << endl;
    
    for (ll i = 1; i <= n; i ++){
        ll mid = bsearch_1(1, n, x[i]);
//         cout << x[mid] << endl;
        if (x[mid] == x[i])
            cnt += 1;
    }
//     for (ll i = 1; i <= n; i ++) cout << x[i] << endl;
        cout << cnt;
}

F题

f题就是直接找规律模拟，自己第一次做的时候一直段错误，自己在网上也没找到原因，后来问师哥才知道vector没有分配空间之前只能用push_back插入数据。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <list>

using namespace std;

typedef long long ll;

const int N = 1e6 + 10;

struct person
{
    int num;
    int love;
};



int main(){
    int n;
    cin >> n;
    vector <person> ve(n);
//     vector <person> ve；
    for (int i = 0; i < n; i ++) {
        ve[i].num = i + 1;
        cin >> ve[i].love;
    }
    int cnt = 0;
    int fav = ve[0].love;
    int p = n;
    while (ve.size() > 1) {
        cnt = (fav % p + cnt - 1) % p;

        if (cnt == -1)
            cnt = ve.size() - 1;
        
        fav = ve[(cnt + 1) % p].love;
        ve.erase(ve.begin() + cnt);
        p --;
    }
    cout << ve[0].num << endl;
}