제출 #530663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530663		shmad	Bomb (IZhO17_bomb)	C++17	0 / 100	96 ms	6436 KiB

bomb

    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
    #pragma GCC target ("avx2")
     
    #include <bits/stdc++.h>
     
    #define int long long
    #define vt vector
    #define pb push_back
    #define all(x) (x).begin(), (x).end()
    #define sz(x) (int)(x).size()
    #define ff first
    #define ss second
    #define dbg(x) cerr << #x << " = " << x << '\n'
     
    using namespace std;
    using ll = long long;
    using pii = pair<int, int>;
    using vvi = vt< vt<int> >;
     
    const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);
    const double eps = 1e-6;
     
    mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
    void solve () {
    	int n, m;
    	cin >> n >> m;
    	int x = n * m;
    	for (int i = 1; i <= n; i++) {
    		for (int j = 1; j <= m; j++) {
    			char c;
    			cin >> c;
    		}
    	}
    	int ans = (rng() % x);
		cout << (ans == 0 ? x : ans);
      	cout << '\n';
    }
     
    bool testcases = 0;
                      
    signed main() {
        cin.tie(0) -> sync_with_stdio(0);
        int test = 1;
        if (testcases) cin >> test;
        for (int cs = 1; cs <= test; cs++) {
            solve();
        }
    }

• Subtask 1: 0 / 100