oj.uz

Submission #457612

# Submission time Handle Problem Language Result Execution time Memory
457612 2021-08-07T08:54:24 Z idas Coins (LMIO19_monetos) C++11
7.11345 / 100
 17 ms 472 KB 
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define F first
#define S second
#define PB push_back
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;


const int N=310;
int ts, n, k1, k2, g[N][N];

int main()
{
    FAST_IO;
    cin >> ts >> n >> k1 >> k2;
    FOR(i, 0, n) FOR(j, 0, n){int x; cin >> x;}
    /*vector<pair<int, pii>> inf;
    FOR(i, 0, n)
    {
        FOR(j, 0, n)
        {
            cin >> g[i][j];
        }
    }

    bool going=true;
    while(going){
        going=false;
        FOR(i, 0, n-1)
        {
            FOR(j, 0, n-1)
            {
                if(g[i][j]==0) continue;
                if(g[i+1][j]==0){
                    swap(g[i][j], g[i+1][j]);
                    going=true;
                }
                else if(g[i][j+1]==0){
                    swap(g[i][j], g[i][j+1]);
                    going=true;
                }
            }
        }
    }

    FOR(i, 0, n)
    {
        FOR(j, 0, n)
        {
            cout << g[i][j] << " ";
        }
        cout << '\n';
    }*/
    FOR(i, 0, n-1) cout << 0 << " ";
    cout << 1 << '\n';
    FOR(i, 1, n-1)
    {
        FOR(j, 0, n)
        {
            if(j>=n/2){
                cout << 1 << " ";
            }
            else cout << 0 << " ";
        }
        cout << '\n';
    }
    cout << 0 << " ";
    FOR(i, 0, n-1) cout << 1 << " ";
}

Subtask #1
7.11344857167 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB K = 24
2 Incorrect 1 ms 204 KB K = 648
3 Incorrect 14 ms 472 KB K = 21115
4 Partially correct 14 ms 444 KB K = 23242
5 Partially correct 14 ms 460 KB K = 18430
6 Partially correct 14 ms 460 KB K = 22272
7 Incorrect 14 ms 472 KB K = 22847
8 Partially correct 14 ms 460 KB K = 20077
9 Partially correct 17 ms 460 KB K = 21052
10 Incorrect 14 ms 460 KB K = 22618