# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590669 | Jakub_Wozniak | Coins (LMIO19_monetos) | C++14 | 23 ms | 832 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int T,K1,K2, N;
int plansza[309][309];
struct pozycja
{
int x;
int y;
};
int main()
{
cin >> T >> N >> K1 >> K2;
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
cin >> plansza[i][j];
}
}
pozycja poz;
int s=0,wynik=0;
for(int i=N-1;i>=0;i--)
{
for(int j=N-1;j>=0;j--)
{
if(plansza[i][j]==0)
{
for(int l=j-1;l>=0;l--)
{
if(plansza[i][l]==1)
{
s=1;
break;
}
}
for(int l=i-1;l>=0;l--)
{
if(plansza[l][j]==1)
{
s=1;
break;
}
}
if(s>=1)
{
plansza[i][j]=s;
wynik++;
}
}
s=0;
}
}
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
if(plansza[i][j]==1 && wynik>0)
{
plansza[i][j]=0;
wynik--;
}
}
}
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
cout << plansza[i][j] << " ";
}
cout << "\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |