Submission #786056

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
786056	2023-07-18T00:55:55 Z	Ozy	L-triominoes (CEOI21_ltriominoes)	C++17	0 / 100	1 ms	468 KB

ltrominoes

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,llix   >

#define MAX

lli a,b,n,w,h;
lli arr[15][1002];
vector<lli> aristas[(1<<13)+2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> w >> h >> n;
    if (w == 2 || w == 4 || w == 8 || w == 10) {
        if (h%3 == 0) cout << "YES";
        else cout << "NO";
    }
    else if (w == 3 || w == 9) {
        if (h%2 == 0) cout << "YES";
        else cout << "NO";
    }
    else if (w == 5 || w == 7 || w == 10 || w == 11 || w == 13) {
        if (h%6 == 0) cout << "YES";
        else cout << "NO";
    }
    else if (w == 6 || w == 12) {
        cout << "YES";
    }

    return 0;
}



 /*   rep(i,1,n) {
        cin >> a >> b;
        arr[a][b] = 1;
    }

    //genera las transiciones
    lli pos = 0;
    lli lim = (1<<13)-1;
    while (pos <= lim) {

    }

    rep(y,1,h) {

    }*/

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	468 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Incorrect	1 ms	468 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	432 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Incorrect	1 ms	468 KB	Output isn't correct
5	Halted	0 ms	0 KB	-