# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
590717 | 2022-07-06T09:13:01 Z | Jakub_Wozniak | Coins (LMIO19_monetos) | C++14 | 1050 ms | 952 KB |
#include <bits/stdc++.h> using namespace std; int T,K1,K2, N; int plansza[309][309]; struct pozycja { int x; int y; }; pozycja najblizej_1() { pozycja poz; for(int i=0;i<N;i++) { for(int j=0;j<N;j++) { if(plansza[i][j]==1) { poz.x=j; poz.y=i; break; } } } return poz; } 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; plansza[najblizej_1().y][najblizej_1().x]=0; wynik++; } } s=0; } } for(int i=0;i<N;i++) { for(int j=0;j<N;j++) { cout << plansza[i][j] << " "; } cout << "\n"; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | improper placement |
2 | Incorrect | 2 ms | 312 KB | improper placement |
3 | Incorrect | 1026 ms | 952 KB | improper placement |
4 | Incorrect | 1018 ms | 944 KB | improper placement |
5 | Incorrect | 994 ms | 948 KB | improper placement |
6 | Incorrect | 1004 ms | 944 KB | improper placement |
7 | Incorrect | 1014 ms | 944 KB | improper placement |
8 | Incorrect | 1006 ms | 948 KB | improper placement |
9 | Incorrect | 1050 ms | 948 KB | improper placement |
10 | Incorrect | 1000 ms | 944 KB | improper placement |