UVA 11916 Emoogle Grid（离散对数、BSGS算法）

题目链接：
UVA 11916 Emoogle Grid
分析：
处理得到最后会得到需要求解式子:$a ^ x = b (mod p)$,其中$a, b, p$已知，求 x <script type="math/tex" id="MathJax-Element-27">x</script>的最下解。保证有解。
离散对数。用到了BSGS（大步小步算法)。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <map>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const ll mod = (ll)(1e8) + 7;
const int MAX_N = 510;

int T, cases = 0;
ll K, R, N, B, Max;

struct Blocked{
    ll row, col;

    bool operator < (const Blocked& rhs) const {
        if(col != rhs.col) return col < rhs.col;
        return row < rhs.row;
    }
}blocked[MAX_N];

ll quick_pow(ll a, ll b)
{
    ll res = 1, tmp = a;
    while(b){
        if(b & 1) res = res * tmp % mod;
        tmp = tmp * tmp % mod;
        b >>= 1;
    }
    return res;
}

ll ex_gcd(ll a, ll b, ll& x, ll& y)
{
    if(b == 0) {
        x = 1, y = 0;
        return a;
    }
    ll d = ex_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}

ll BSGS(ll a, ll b, ll p) {
    ll m = (ll)ceil(sqrt(p + 0.5));
    map<ll, int> rid;
    ll tmp = 1;
    for (int i = 0; i < m; ++ i) {
        if(rid.find(tmp) == rid.end()) rid[tmp] = i; //需要判断是否已经出现过
        //rid[tmp] = i;
        tmp = tmp * a % p;
    }

    ll tmp2 = quick_pow(tmp, p - 2); //模质数求逆元
    for (int i = 0; i < m; ++ i) {
        if (rid.find(b) != rid.end()) return rid[b] + i * m;
        b = b * tmp2 % p;
    }
} 

int main()
{
    scanf("%d", &T);
    while(T--){
        int begin_time = clock();
        Max = 1;
        scanf("%lld%lld%lld%lld", &N, &K, &B, &R);
        for(int i = 0; i < B; i++){
            scanf("%lld%lld", &blocked[i].row, &blocked[i].col);
            Max = max(Max, blocked[i].row);
        }
        sort(blocked, blocked + B);
        ll knum = 0, bottom = 0;
        for(int i = 0; i < B; i++){
            if(blocked[i].row > 1) {
                if(i == 0) knum++;
                else if(blocked[i - 1].col != blocked[i].col) knum++;
                else if(blocked[i - 1].row + 1 != blocked[i].row) knum++;
            }
            if(blocked[i].row == Max) bottom++;
        }
        //printf("knum = %lld bottom = %lld ", knum, bottom);
        knum += (N - bottom);
        ll known = quick_pow(K, knum) * quick_pow(K - 1, N * Max - B - knum) % mod;

        printf("Case %d: ", ++cases);
        if(known == R){
            printf("%lld\n", Max);
            continue;
        }
        known = known * quick_pow(K, bottom) % mod * quick_pow(K - 1, N - bottom) % mod;
        //printf("known = %lld\n", known);
        ll x, y, d, ans;
        d = ex_gcd(known, mod, x, y);
        x = (x * (R / d) % mod + mod) % mod;
        ans = BSGS(quick_pow(K - 1, N), x, mod);
        printf("%lld\n", ans + Max + 1);
    }
    return 0;
}