250
- class KeyDungeonDiv2 {
- public:
- int countDoors(vector <int> R, vector <int> G, vector <int> ks)
- {
- const int N = R.size();
- int cnt = 0;
-
- for (int i = 0; i < N; ++i) {
- int r = R[i];
- int g = G[i];
- r = max(r - ks[0], 0);
- g = max(g - ks[1], 0);
- cnt += (r + g <= ks[2]);
- }
-
- return cnt;
- }
class KeyDungeonDiv2 {
public:
int countDoors(vector <int> R, vector <int> G, vector <int> ks)
{
const int N = R.size();
int cnt = 0;
for (int i = 0; i < N; ++i) {
int r = R[i];
int g = G[i];
r = max(r - ks[0], 0);
g = max(g - ks[1], 0);
cnt += (r + g <= ks[2]);
}
return cnt;
}
0 件のコメント :
コメントを投稿