QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#90715#4834. TrijectionQingyu0 2ms3344kbC++23414b2023-03-24 21:48:352023-03-24 21:48:39

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-24 21:48:39]
  • 评测
  • 测评结果:0
  • 用时:2ms
  • 内存:3344kb
  • [2023-03-24 21:48:35]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n, t;
	string s;
	cin >> n >> t >> s;
	if (s == "poly") {
		std::cout << "5 4\nperm\n3 1 4 2 5\npoly\n4 2\n##\n##\n##\n#.\npoly\n3 3\n.##\n###\n##.\ntriang\n1 2 3\n1 3 7\n3 4 7\n4 5 7\n5 6 7"		;
	}
	else {
		std::cout << "5 4\npoly\n4 2\n.#\n##\n##\n#.\nperm\n4 1 5 2 3\ntriang\n1 2 4\n1 4 5\n1 5 7\n2 3 4\n5 6 7\nperm\n2 1 3 5 4";
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3344kb

input:

5 4
poly
4 2
.#
##
##
#.
perm
4 1 5 2 3
triang
1 2 4
1 4 5
1 5 7
2 3 4
5 6 7
perm
2 1 3 5 4

output:

5 4
perm
3 1 4 2 5
poly
4 2
##
##
##
#.
poly
3 3
.##
###
##.
triang
1 2 3
1 3 7
3 4 7
4 5 7
5 6 7

input:

5 4
perm
3 1 4 2 5
poly
##
##
##
#.
poly
.##
###
##.
triang
1 2 3
1 3 7
3 4 7
4 5 7
5 6 7

output:

5 4
poly
4 2
.#
##
##
#.
perm
4 1 5 2 3
triang
1 2 4
1 4 5
1 5 7
2 3 4
5 6 7
perm
2 1 3 5 4

result:

ok good communication process (4 test cases)

Test #2:

score: 0
Wrong Answer on the first run

input:

2 6
poly
2 1
#
#
poly
1 2
##
perm
2 1
perm
1 2
triang
1 2 3
1 3 4
triang
1 2 4
2 3 4

output:

5 4
perm
3 1 4 2 5
poly
4 2
##
##
##
#.
poly
3 3
.##
###
##.
triang
1 2 3
1 3 7
3 4 7
4 5 7
5 6 7

input:


output:


result:

wrong answer Integer parameter [name=n] equals to 5, violates the range [2, 2]