QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#60056 | #1893. Friendly Rooks | Sa3tElSefr# | WA | 2ms | 3664kb | C++23 | 1.5kb | 2022-11-02 19:31:35 | 2022-11-02 19:31:38 |
Judging History
answer
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define ld double
using namespace std;
const int N = 5e2 + 5, lg = 19, mod = 998244353;
const int M = 1e6 + 5;
const int b = 31;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
if (min(n, m) < k) {
cout << "Impossible\n";
return 0;
}
cout << "Possible\n";
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cout << (i == j ? '*' : '.');
}
cout << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
input:
1 2 1
output:
Possible *.
result:
ok n = 1, m = 2, k = 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
3 3 100
output:
Impossible
result:
ok n = 3, m = 3, k = 100
Test #3:
score: -100
Wrong Answer
time: 2ms
memory: 3664kb
input:
3 5 2
output:
Possible *.... .*... ..*..
result:
wrong answer Wrong number of rooks: 2 expected, 3 found