NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	1ms	320 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	508 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	4ms	404 KiB
#12	Accepted 5	40ms	1.5 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	404 KiB
#15	Accepted 5	35ms	1.4 MiB
#16	Accepted 5	14ms	788 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	3ms	404 KiB
#19	Accepted 5	38ms	1.5 MiB
#20	Accepted 5	19ms	964 KiB

#include <iostream>
#include <cstdio>
#include <utility>
#include <algorithm>

using namespace std;

#define F first
#define S second
typedef long long ll;
const int M = 1e5 + 1;
const ll MOD = 1e9 + 7;

int t, n, m, v, tot;
char ch;
bool flag;
int c[M];
ll ans;
pair<int, int> cd[M];

int read(void)
{
    int x = 0;
    do
    {
        ch = getchar();
    } while (ch < '0' || ch > '9');
    while (ch >= '0' && ch <= '9')
    {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}

void write(ll x)
{
    if (x >= 10)
    {
        write(x / 10);
    }
    putchar('0' + x % 10);
}

ll qpow(ll a, ll b)
{
    ll res = 1;
    while (b)
    {
        if (b & 1)
        {
            res = res * a % MOD;
        }
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

int main(void)
{
    freopen("assign.in", "r", stdin);
    freopen("assign.out", "w", stdout);

    t = read();
    while (t--)
    {
        n = read();
        m = read();
        v = read();
        for (int i = 0; i < m; i++)
        {
            cd[i].F = read();
            cd[i].S = read();
        }

        sort(cd, cd + m);
        flag = false;
        tot = 1;
        c[0] = cd[0].F;
        for (int i = 1; i < m; i++)
        {
            if (cd[i].F == cd[i - 1].F)
            {
                if (cd[i].S != cd[i - 1].S)
                {
                    flag = true;
                    write(0);
                    putchar('\n');
                    break;
                }
            }
            else
            {
                c[tot++] = cd[i].F;
            }
        }
        if (flag)
        {
            continue;
        }

        ans = qpow(v, 2LL * (c[0] - 1));
        for (int i = 1; i < tot; i++)
        {
            ans = ans * ((qpow(v, 2LL * (c[i] - c[i - 1])) + MOD - qpow(v, c[i] - c[i - 1] - 1) * (v - 1) % MOD) % MOD) % MOD;
        }
        ans = ans * qpow(v, 2LL * (n - c[tot - 1])) % MOD;
        write(ans);
        putchar('\n');
    }

    return 0;
}

递交者: BJ-0280
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 BJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 2 KiB
递交时间: 2024-12-6 17:31:11
评测时间: 2024-12-6 17:31:13

分数: 100
总耗时: 172ms
峰值时间: 40ms
峰值内存: 1.5 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录