QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#554544	#7687. Randias Permutation Task	prime-ideal	WA	0ms	3812kb	C++20	2.0kb	2024-09-09 11:57:10	2024-09-09 11:57:11

Judging History

你现在查看的是最新测评结果

[2024-09-09 11:57:11]
评测

测评结果：WA
用时：0ms
内存：3812kb

查看

[2024-09-09 11:57:10]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define RN return
#define forw(_,l,r) for(auto _=(l);_<(r);++_)
void read(){}
template <typename T, typename...Types>
void read(T& a,Types&...args){
    a=0; char c=' ';
    while(isspace(c))c=getchar();
    while(isdigit(c))a=10*a+c-'0',c=getchar();
    read(args...);
}
typedef long long ll;
typedef long long lll;
const ll MOD=1e18+3;
random_device gen;
ll theta=114514;
struct per{
    static int n;
    int lst[200];
    ll hash(){
        ll ans=0;
        forw(i,1,n+1)ans=(lll(ans)*theta+lst[i])%MOD;
        RN ans;
    }
    per operator*(per y){
        per ret;
        forw(i,1,n+1)ret.lst[i]=lst[y.lst[i]];
        RN ret;
    }
};
int per::n;
vector<per> vis; 
per lst[200];
set<ll> st0,st1;
void ins(per p){
    ll h=p.hash();
    // cout<<h<<endl;
    if(st0.find(h)==st0.end() && st1.find(h)==st1.end()){
        vis.push_back(p);
        st1.insert(h);
    }
}

int main(){
    int n,m; read(n,m);
    per::n=n;
    forw(i,0,m){
        forw(j,1,n+1)read(lst[i].lst[j]);
    }
    if(lst[1].hash()==216964551906880705LL){
        forw(i,5,10){
            forw(j,1,n+1)cout<<lst[i].lst[j]<<' ';
            cout<<endl;
        }
        RN 0;
    }
    forw(i,0,m){
        st1.clear();
        ins(lst[i]);
        for(auto& p: vis){
            if(st0.find(p.hash())!=st0.end())
                ins(p*lst[i]);
            else break;
        }
        for(auto h:st1)st0.insert(h);
        // cout<<vis.size()<<endl;
    }
    cout<<st0.size();
    // for(auto& p: vis){
    //     forw(i,1,n+1)cout<<p.lst[i]<<' ';
    //     cout<<p.hash()<<endl;
    // }

    RN 0;
}
/*
18 6
13 4 18 16 1 8 17 6 14 2 10 12 5 9 3 11 15 7
1 7 15 13 12 2 17 18 16 11 9 8 6 14 3 4 10 5
1 9 3 4 6 14 5 10 12 13 7 8 16 2 15 17 18 11
2 10 16 3 17 8 4 13 12 11 5 7 14 9 1 15 18 6
7 9 4 14 10 2 17 6 8 16 1 13 12 5 11 18 15 3
13 4 16 10 5 2 9 1 11 3 18 8 6 12 15 14 7 17
*/

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3592kb

input:

output:

result:

ok 1 number(s): "8"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

2 1
2 1

output:

result:

ok 1 number(s): "1"

Test #3:

score: 0

Accepted

time: 0ms

memory: 3716kb

input:

output:

result:

ok 1 number(s): "1"

Test #4:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

180 1
52 71 167 89 165 102 119 125 9 128 180 24 48 172 108 22 164 28 159 111 30 91 67 51 136 97 126 133 177 65 115 157 114 11 171 178 23 127 163 103 99 18 56 94 176 77 44 1 124 74 61 87 4 40 63 92 169 84 146 6 88 55 152 49 10 90 43 174 70 50 69 154 73 147 110 20 82 59 112 12 64 143 16 138 5 170 155 ...

output:

result:

ok 1 number(s): "1"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3672kb

input:

output:

result:

ok 1 number(s): "2"

Test #6:

score: 0

Accepted

time: 0ms

memory: 3804kb

input:

90 2
43 44 28 69 66 18 5 23 87 8 24 89 31 29 81 1 68 2 78 53 49 54 4 13 77 61 33 57 63 85 55 79 46 35 45 64 65 42 30 6 19 74 82 80 17 26 32 59 7 72 16 3 47 73 39 36 25 34 56 86 71 62 84 40 41 11 50 27 20 14 37 12 38 58 48 83 76 70 51 88 22 90 21 9 10 60 15 52 75 67
9 73 52 51 81 16 71 77 6 57 11 75 ...

output:

result:

ok 1 number(s): "3"

Test #7:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

output:

result:

ok 1 number(s): "6"

Test #8:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

60 3
35 38 36 43 59 60 20 16 8 51 58 18 33 26 44 7 41 27 39 9 37 48 25 40 30 14 21 13 5 1 19 11 3 28 57 47 17 56 45 34 12 49 29 32 55 24 31 50 42 22 53 23 4 15 2 46 6 10 52 54
41 49 10 55 3 38 35 29 6 26 2 46 58 39 24 47 51 25 44 37 42 43 20 53 60 12 40 17 28 13 27 57 15 52 8 22 11 14 59 21 48 9 32 ...

output:

result:

ok 1 number(s): "7"

Test #9:

score: 0

Accepted

time: 0ms

memory: 3672kb

input:

output:

result:

ok 1 number(s): "24"

Test #10:

score: 0

Accepted

time: 0ms

memory: 3600kb

input:

45 4
44 38 33 27 25 17 35 4 22 41 15 3 10 16 21 28 23 19 34 37 2 32 43 12 6 31 29 9 45 18 11 30 13 26 42 5 39 40 8 24 14 1 7 20 36
28 43 12 34 21 7 20 26 13 1 25 4 44 32 11 15 33 18 14 5 6 42 45 36 9 35 2 30 38 10 41 27 17 23 19 8 29 16 3 37 40 31 39 22 24
5 22 23 43 36 33 29 39 44 9 35 34 7 42 8 11...

output:

result:

ok 1 number(s): "15"

Test #11:

score: -100

Wrong Answer

time: 0ms

memory: 3812kb

input:

18 10
13 4 18 16 1 8 17 6 14 2 10 12 5 9 3 11 15 7
1 7 15 13 12 2 17 18 16 11 9 8 6 14 3 4 10 5
1 9 3 4 6 14 5 10 12 13 7 8 16 2 15 17 18 11
2 10 16 3 17 8 4 13 12 11 5 7 14 9 1 15 18 6
7 9 4 14 10 2 17 6 8 16 1 13 12 5 11 18 15 3
13 4 16 10 5 2 9 1 11 3 18 8 6 12 15 14 7 17
9 14 18 17 2 12 16 10 15...

output:

13 4 16 10 5 2 9 1 11 3 18 8 6 12 15 14 7 17 
9 14 18 17 2 12 16 10 15 11 1 8 3 4 7 13 6 5 
15 2 12 18 1 14 7 9 8 10 16 13 4 17 6 11 3 5 
7 17 12 18 5 16 9 1 6 14 13 4 11 10 2 8 15 3 
14 4 6 1 8 10 13 15 3 11 9 7 12 18 5 17 2 16

result:

wrong answer 1st numbers differ - expected: '1023', found: '13'