Submission #457624

#	Time	Username	Problem	Language	Result	Execution time	Memory
457624		idas	Coins (LMIO19_monetos)	C++11	11.57 / 100	491 ms	836 KiB

monetos

#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;
    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)
        {
            FOR(j, 0, n)
            {
                if(g[i][j]==0) continue;
                if(i+1<=n-1 && g[i+1][j]==0){
                    swap(g[i][j], g[i+1][j]);
                    going=true;
                }
                else if(j+1<=n-1 && 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';
    }
}

• Subtask 1: 11.5735186371 / 100