QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#590597#7854. 这不是一道数据结构题byron100005 98ms18988kbC++171.4kb2024-09-26 08:41:272024-09-26 08:41:27

Judging History

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

  • [2024-09-26 08:41:27]
  • 评测
  • 测评结果:5
  • 用时:98ms
  • 内存:18988kb
  • [2024-09-26 08:41:27]
  • 提交

answer

#if defined(_USE_PCH_)
#include "pch.hpp"
#else
#include <bits/stdc++.h>
#endif
#define RNG(V_, A_, B_, ...) for(int V_=(A_), V_##_END=(B_) __VA_OPT__(,) __VA_ARGS__; V_<=V_##_END; V_++)
#define IRNG(V_, A_, B_) for(int V_=(A_), V_##_END=(B_); V_>=V_##_END; V_--)
#ifdef _WIN32
#define long __int64
#endif
using namespace std;
const int MAXN=2e5+10,MOD=1e9+7;
int n,m,nnd,deg[MAXN],nsquare; vector<int> G[MAXN];
int dfn[MAXN],low[MAXN],dfnc,stk[MAXN],stkp;
void tarjan(int u){
    dfn[u]=low[u]=++dfnc; stk[++stkp]=u;
    for(int v:G[u]){
        if(!dfn[v]){
            tarjan(v);
            low[u]=min(low[u],low[v]);
            if(low[v]==dfn[u]){
                int c=0;
                deg[u]++,c++;
                for(int w; (w=stk[stkp])!=u; stkp--) deg[w]++,c++;
                nsquare+=c>2;
            }
        }else low[u]=min(low[u],dfn[v]);
    }
}
long fac[MAXN],ans=1;
int main(){
#if defined(_LOCAL_)
    freopen("in","r",stdin);
//  freopen("out","w",stdout);
#else
//  freopen("rated.in","r",stdin);
//  freopen("rated.out","w",stdout);
#endif
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>m;
    RNG(_,1,m,u,v) cin>>u>>v,G[u].push_back(v),G[v].push_back(u);
    nnd=n;
    tarjan(1);
    ans=n;
    fac[0]=1; RNG(i,1,n) fac[i]=fac[i-1]*i%MOD;
    RNG(_,1,nsquare) ans=ans*2%MOD;
    RNG(i,1,n) ans=ans*fac[deg[i]]%MOD;
    cout<<ans<<"\n";

}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 5
Accepted
time: 2ms
memory: 9792kb

input:

7 9
1 2
2 3
3 4
1 5
2 5
2 6
5 6
5 7
6 7

output:

56

result:

ok single line: '56'

Test #2:

score: 0
Wrong Answer
time: 2ms
memory: 8372kb

input:

10 14
10 9
4 1
7 10
3 5
9 6
1 7
8 5
2 7
8 6
4 10
9 3
8 7
4 5
7 3

output:

40

result:

wrong answer 1st lines differ - expected: '0', found: '40'

Subtask #2:

score: 5
Accepted

Test #5:

score: 5
Accepted
time: 97ms
memory: 18940kb

input:

200000 199999
76849 117660
190775 11517
36929 136177
161792 186900
165326 184615
74197 120051
7891 83240
121896 35204
83314 195652
104144 158348
71191 182187
122824 50031
108950 179173
165120 190230
156949 181392
171984 82834
96017 30143
58114 108979
38698 90371
185399 171751
139913 99465
71566 1324...

output:

437454115

result:

ok single line: '437454115'

Test #6:

score: 5
Accepted
time: 93ms
memory: 18588kb

input:

200000 199999
6574 23146
34257 69209
155380 164090
110026 127221
193115 99889
5635 174278
55712 77121
26697 49953
22754 96882
63538 126940
194879 165261
41026 41295
30210 92107
74413 48768
21400 93816
132836 161798
106855 181482
139713 172322
188984 22749
138035 187484
119125 94408
106547 197156
855...

output:

113291706

result:

ok single line: '113291706'

Test #7:

score: 5
Accepted
time: 97ms
memory: 18644kb

input:

200000 199999
31632 184606
168095 2953
125939 52574
192991 195231
89249 63587
67762 15189
127486 26911
55580 120635
164243 67832
132583 173571
144167 123204
145229 101807
103885 170616
134195 61189
192909 104601
164109 127893
96486 109669
155596 168629
144450 40523
111830 166912
21452 144116
168225 ...

output:

695768886

result:

ok single line: '695768886'

Test #8:

score: 5
Accepted
time: 93ms
memory: 18988kb

input:

200000 199999
163361 68930
19490 33356
160159 49369
191573 191277
25950 191040
87000 96084
87600 7514
36433 91932
124379 117605
192879 188658
132884 148743
167108 124881
145773 56391
131418 128073
157008 76084
141192 147983
85318 133420
94748 189411
50453 78717
71148 12192
164264 189793
112210 18103...

output:

733222740

result:

ok single line: '733222740'

Subtask #3:

score: 0
Wrong Answer

Dependency #2:

100%
Accepted

Test #9:

score: 0
Wrong Answer
time: 98ms
memory: 18680kb

input:

200000 200000
12724 99480
110070 33803
133108 189774
90549 132698
44107 190886
80834 45073
196688 3535
65325 152337
190962 142430
1881 60227
26322 185955
145062 99829
183113 179795
10631 100971
60798 37230
149752 51457
119906 123989
118777 44821
140764 181969
101534 197139
108651 135722
56961 189607...

output:

285778087

result:

wrong answer 1st lines differ - expected: '845696751', found: '285778087'

Subtask #4:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 2ms
memory: 8408kb

input:

300 305
289 290
34 35
111 140
90 93
233 240
110 271
116 117
12 21
141 142
53 57
21 85
99 102
34 42
183 184
240 264
252 253
223 224
159 160
126 131
112 113
28 33
50 52
204 208
185 188
46 50
262 264
197 199
111 136
259 261
290 294
49 50
263 264
210 212
291 294
203 208
184 185
120 121
111 131
210 240
2...

output:

929950453

result:

wrong answer 1st lines differ - expected: '482487615', found: '929950453'

Subtask #5:

score: 0
Wrong Answer

Test #18:

score: 0
Wrong Answer
time: 0ms
memory: 10040kb

input:

300 500
279 256
263 65
40 62
236 256
8 193
164 235
242 256
27 219
72 244
49 253
289 261
162 113
196 199
121 222
293 245
33 186
206 279
111 139
97 15
203 24
245 157
184 59
188 90
239 283
42 5
107 108
267 51
200 126
286 282
293 59
42 261
276 216
152 6
92 220
225 69
88 166
179 109
158 144
133 18
147 18...

output:

147760684

result:

wrong answer 1st lines differ - expected: '159215763', found: '147760684'

Subtask #6:

score: 0
Wrong Answer

Test #23:

score: 20
Accepted
time: 0ms
memory: 8712kb

input:

300 597
181 11
16 186
144 42
80 274
72 186
238 172
7 268
225 118
198 84
274 214
170 27
181 44
171 74
270 266
20 6
296 108
45 25
32 198
99 86
129 110
281 273
67 47
259 107
277 265
264 145
215 218
264 164
156 281
100 23
284 125
109 280
92 203
108 74
227 171
213 81
262 239
206 111
5 23
90 121
77 274
23...

output:

600

result:

ok single line: '600'

Test #24:

score: 20
Accepted
time: 2ms
memory: 10328kb

input:

300 597
145 168
81 149
192 248
114 243
113 25
201 259
190 156
225 40
127 199
225 33
229 4
298 36
243 81
31 163
192 294
258 31
8 299
210 28
87 143
180 205
270 281
257 174
173 187
203 128
179 292
34 4
292 236
288 248
78 255
7 239
191 124
227 194
113 187
270 93
164 238
256 37
121 88
279 133
11 99
189 1...

output:

600

result:

ok single line: '600'

Test #25:

score: 20
Accepted
time: 0ms
memory: 9884kb

input:

300 597
137 70
124 146
24 239
38 218
186 180
244 153
274 153
274 298
256 126
36 174
172 157
60 274
270 87
207 14
114 280
221 51
165 106
166 25
29 62
210 122
104 157
218 173
134 154
65 120
131 46
45 262
138 253
48 187
118 114
101 184
47 244
200 60
296 267
34 128
129 165
53 246
102 123
153 238
238 249...

output:

600

result:

ok single line: '600'

Test #26:

score: 0
Wrong Answer
time: 3ms
memory: 9808kb

input:

300 597
279 221
253 68
255 267
293 234
88 82
272 133
157 107
129 78
221 160
45 205
8 197
295 127
212 288
232 224
274 23
101 65
4 272
112 300
51 225
221 236
213 236
166 182
87 57
236 254
295 259
28 128
124 39
157 177
133 49
64 45
291 94
161 111
98 144
244 92
135 64
39 44
171 244
241 238
268 296
208 2...

output:

600

result:

wrong answer 1st lines differ - expected: '0', found: '600'

Subtask #7:

score: 0
Skipped

Dependency #4:

0%

Subtask #8:

score: 0
Skipped

Dependency #1:

0%