QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#361731 | #8516. LED Matrix | ucup-team1055# | WA | 0ms | 3884kb | C++20 | 4.8kb | 2024-03-23 13:06:12 | 2024-03-23 13:06:12 |
Judging History
answer
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;
#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
for (auto &x : v) is >> x;
return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
template<typename T>
void out(const vector<vector<T>> &vv){
int s = (int)vv.size();
for (int i = 0; i < s; i++) out(vv[i]);
}
struct IoSetup {
IoSetup(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetup_noya2;
} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{
const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 = 998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";
void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }
} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{
unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
if (a == 0 || b == 0) return a + b;
int n = __builtin_ctzll(a); a >>= n;
int m = __builtin_ctzll(b); b >>= m;
while (a != b) {
int mm = __builtin_ctzll(a - b);
bool f = a > b;
unsigned long long c = f ? a : b;
b = f ? b : a;
a = (c - b) >> mm;
}
return a << min(n, m);
}
template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }
long long sqrt_fast(long long n) {
if (n <= 0) return 0;
long long x = sqrt(n);
while ((x + 1) * (x + 1) <= n) x++;
while (x * x > n) x--;
return x;
}
template<typename T> T floor_div(const T n, const T d) {
assert(d != 0);
return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}
template<typename T> T ceil_div(const T n, const T d) {
assert(d != 0);
return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}
template<typename T> void uniq(vector<T> &v){
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }
} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
namespace noya2{
/* ~ (. _________ . /) */
}
using namespace noya2;
#line 2 "c.cpp"
void solve(){
int r, c, k; in(r,c,k);
bool ok = true;
rep(i,r){
string s, t; in(s,t);
bool ex = false;
rep(j,k){
if (t[j] == '*'){
ex = true;
}
}
if (!ex) continue;
bool check = true;
rep(j,k){
if (s[j] == '-') check = false;
}
if (!check) ok = false;
}
out(ok ? 'Y' : 'N');
}
int main(){
int t = 1; //in(t);
while (t--) { solve(); }
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
6 6 6 ****** --*--- ****** -**--- ****** ****** ****** ****** ****** -**--- *****- --*---
output:
N
result:
ok "N"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
2 4 6 **** ------ ***- *-----
output:
N
result:
ok "N"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
2 6 4 ****** **** *-**-* ----
output:
Y
result:
ok "Y"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
1 1 1 * *
output:
Y
result:
ok "Y"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
1 1 1 * -
output:
Y
result:
ok "Y"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 1 1 - *
output:
N
result:
ok "N"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1 1 1 - -
output:
Y
result:
ok "Y"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
28 120 84 *-***********-***********-***********-***********-***********-***********-***********-***********-***********-********** *------**----**------**----**------**----**------**----**------**----**------**----* ******-***********-***********-***********-***********-***********-***********-*****...
output:
N
result:
ok "N"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
40 154 168 ********************************************************************************************************************************************************** *----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**----**-...
output:
Y
result:
ok "Y"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 1 2 * -*
output:
Y
result:
ok "Y"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
1 1 3 * -*-
output:
Y
result:
ok "Y"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
1 2 1 ** -
output:
Y
result:
ok "Y"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
1 2 2 -- --
output:
Y
result:
ok "Y"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
1 2 3 ** ---
output:
Y
result:
ok "Y"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
1 3 1 --* -
output:
Y
result:
ok "Y"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
1 3 2 *** -*
output:
Y
result:
ok "Y"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
1 3 3 --- ---
output:
Y
result:
ok "Y"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
2 1 1 * * - -
output:
Y
result:
ok "Y"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
2 1 2 - -- * *-
output:
Y
result:
ok "Y"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
2 1 3 * --* * --*
output:
Y
result:
ok "Y"
Test #21:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
2 2 1 ** - ** *
output:
Y
result:
ok "Y"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
2 2 2 ** ** ** **
output:
Y
result:
ok "Y"
Test #23:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
2 2 3 -- --- ** ***
output:
Y
result:
ok "Y"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
2 3 1 *** - *-- -
output:
Y
result:
ok "Y"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
2 3 2 *** -* *** -*
output:
Y
result:
ok "Y"
Test #26:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
2 3 3 *** *-* -** ---
output:
Y
result:
ok "Y"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
3 1 1 * * * - - -
output:
Y
result:
ok "Y"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
3 1 2 * -* * *- * **
output:
Y
result:
ok "Y"
Test #29:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
3 1 3 * -** - --- * **-
output:
Y
result:
ok "Y"
Test #30:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
3 2 1 ** * ** - -- -
output:
Y
result:
ok "Y"
Test #31:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
3 2 2 ** *- -* -- ** --
output:
Y
result:
ok "Y"
Test #32:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
3 2 3 ** -** ** --* -* ---
output:
Y
result:
ok "Y"
Test #33:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
3 3 1 *** * *-* - *** *
output:
Y
result:
ok "Y"
Test #34:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
3 3 2 *** -- *** *- *** *-
output:
Y
result:
ok "Y"
Test #35:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
3 3 3 *** -*- *** *-* *** *-*
output:
Y
result:
ok "Y"
Test #36:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
1 1 2 - *-
output:
N
result:
ok "N"
Test #37:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
1 1 3 - --*
output:
N
result:
ok "N"
Test #38:
score: -100
Wrong Answer
time: 0ms
memory: 3636kb
input:
1 2 1 *- *
output:
Y
result:
wrong answer 1st words differ - expected: 'N', found: 'Y'