NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	2ms	408 KiB
#3	Accepted 5	1ms	320 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	316 KiB
#6	Accepted 5	1ms	320 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	2ms	404 KiB
#11	Accepted 5	4ms	404 KiB
#12	Accepted 5	38ms	1.1 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	404 KiB
#15	Accepted 5	37ms	1.1 MiB
#16	Accepted 5	16ms	660 KiB
#17	Accepted 5	2ms	412 KiB
#18	Accepted 5	4ms	444 KiB
#19	Accepted 5	38ms	1.1 MiB
#20	Accepted 5	19ms	780 KiB

#include<bits/stdc++.h>
#define LL long long
#define mes(s, x) memset(s, x, sizeof s)
#define Maxn 100005
#define mod 1000000007
using namespace std;
int read(){
    char c = getchar();
    while(!('0' <= c && c <= '9')) c = getchar();
    int tot = 0;
    while('0' <= c && c <= '9'){
        tot = 10 * tot + c - '0';
        c = getchar();
    }
    return tot;
}
LL Pow(int i, LL x){
    LL s = 1;
    while(i){
        if(i & 1) s = s * x % mod;
        x = x * x % mod;
        i >>= 1;
    }
    return s;
}
struct node{
    int c, d;
    bool operator<(const node i)const{
        return c < i.c;
    }
    bool operator==(const node i)const{
        return c == i.c;
    }
} x[Maxn];
int main(){
    freopen("assign.in", "r", stdin);
    freopen("assign.out", "w", stdout);
    int T = read(), n, m, v;
    LL ans;
    bool flag;
    while(T--){
        n = read(), m = read(), v = read();
        for(int i = 1; i <= m; i++) x[i] = {read(), read()};
        sort(x + 1, x + m + 1);
        flag = 0;
        for(int i = 1; i < m; i++){
            if(x[i].c == x[i + 1].c && x[i].d != x[i + 1].d){
                flag = 1;
                break;
            }
        }
        if(flag){
            puts("0");
            continue;
        }
        m = unique(x + 1, x + m + 1) - x - 1;
        ans = Pow(2 * (x[1].c - 1 + n - x[m].c), v);
        for(int i = 1; i < m; i++) ans = ans * (Pow(2 * (x[i + 1].c - x[i].c), v) - Pow(x[i + 1].c - x[i].c - 1, v) % mod * (v - 1) % mod + mod) % mod;
        printf("%lld\n", ans);
    }
    return 0;
}

递交者: CQ-0046
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 CQ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.5 KiB
递交时间: 2024-12-6 16:36:51
评测时间: 2024-12-6 16:43:48

分数: 100
总耗时: 177ms
峰值时间: 38ms
峰值内存: 1.1 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录