QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#155123 | #5522. F*** 3-Colorable Graphs | eikki | TL | 14ms | 6596kb | C++14 | 676b | 2023-09-01 11:20:50 | 2023-09-01 11:20:51 |
Judging History
answer
#include <iostream>
#include <vector>
#include <map>
#define maxN 10005
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> adj[maxN]; // ai to bj
for (int i = 0; i < m; i++) {
int u, v;
std::cin >> u >> v;
v -= n;
adj[u].push_back(v);
}
std::map<std::pair<int, int>, int> cherry;
bool has4 = 0;
for (int i = 1; i <= n; i++) {
for (auto a : adj[i]) {
for (auto b : adj[i]) {
if (a < b) cherry[{a, b}]++;
if (cherry[{a, b}] > 1) has4 = 1;
}
}
}
if (has4) std::cout << 2;
else std::cout << 3;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3656kb
input:
2 4 1 3 1 4 2 3 2 4
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
3 5 1 4 2 4 2 5 3 5 3 6
output:
3
result:
ok 1 number(s): "3"
Test #3:
score: 0
Accepted
time: 14ms
memory: 6596kb
input:
10000 20000 4570 11730 8803 16440 4257 15381 4455 17636 5256 13543 2172 18421 7735 17847 8537 16010 6175 12263 1079 13410 335 15901 3272 16233 7435 11454 4469 13374 1564 13416 1264 13446 7484 14510 8193 12267 628 15585 1388 11398 5444 19958 2059 18140 8947 13188 6214 17707 7940 12253 6726 11508 1839...
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Time Limit Exceeded
input:
9999 199986 8408 17344 1353 16706 3364 17274 9410 10006 9387 19375 9169 18239 3930 12759 4728 11328 5192 17935 7616 19485 3138 12714 8595 18490 6020 15039 9319 17097 7842 16814 7644 18723 2190 10117 3971 13350 232 15408 6984 12842 6988 17196 9744 18905 6759 13371 4115 18937 1842 13513 6245 18736 207...