oj.uz

Submission #464596

# Submission time Handle Problem Language Result Execution time Memory
464596 2021-08-13T13:55:22 Z gesgha Game (eJOI20_game) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fr(x, l, r) for(int x = l; x <= r; x++)
#define rf(x, l, r) for(int x = l; x >= r; x--)
#define fe(x, y) for(auto& x : y)

#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define pw(x) (ull(1) << ull(x))
#define all(x) (x).begin(),x.end()
#define sz(x) (int)x.size()
#define mt make_tuple
#define ve vector

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <ld,ld> pld;

template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template<typename T>
bool umn(T& a, T b) { return a > b ? a = b, 1 : 0; }
template<typename T>
bool umx(T& a, T b) { return a < b ? a = b, 1 : 0; }

const ll inf = 1e18;
const int intf = 1e9;
const ll mod = 1e9 + 7;
const ld eps = 0.00000001;
const ll N = 30;

ll let[N][N][N][N], n, m, cnt[N][N];

//void rec(int x, int y, int mv){
//    fr(i, x, n){
//        fr(j, y, m){
//            if(let[i][j][i][j + 1]){
//                cnt[i][j]--;
//                cnt[i][j + 1]--;
//                let[i][j]
//                
//            }
//        }
//    }
//    
//}

int main(){

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#else
//    freopen("mountains.in", "r", stdin);
//    freopen("mountains.out","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif

    cin >> n >> m;
//
//    fr(i, 0, n){
//        string s;
//        cin >> s;
//        fr(j, 0, sz(s) - 1){
//            int c;
//            c = s[j] - '0';
//            if(c){
//                cnt[j + 1][i]++;
//                cnt[j + 1][i + 1]++;
//                let[j + 1][i + 1][j + 1][i] = 1;
//                let[j + 1][i][j + 1][i + 1] = 1;
//            }
//        }
//    }
//
//
//
//    fr(i, 0, m - 1){
//        string s;
//        cin >> s;
//        fr(j, 0, sz(s) - 1){
//            int c;
//            c = s[j] - '0';
//            if(c){
//                cnt[j][i + 1]++;
//                cnt[j + 1][i + 1]++;
//                let[j + 1][i + 1][j][i + 1] = 1;
//                let[j][i + 1][j + 1][i + 1] = 1;
//            }
//        }
//    }
    cout << n*m << endl;
    
    
    
    
    
    
    
    

    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

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