# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777487 | 2023-07-09T09:34:35 Z | vjudge1 | Sajam (COCI18_sajam) | C++17 | 18 ms | 4180 KB |
#include<bits/stdc++.h> using namespace std; #define lalala ios_base::sync_with_stdio(false);cin.tie(NULL); //#define endl "\n" #define ll long long #define pb push_back #define N 1005 #define f first #define s second #define M 17 int dp[N]; int main(){ int n,k;cin>>n>>k; int arr[n][n]; for(int i=0;i<n;i++){ string str;cin>>str; for(int j=0;j<n;j++){ arr[i][j]==(str[j]=='o'); } } for(int uwu=0;uwu<2;uwu++){ for(int i=0;i<n;i++){ int bir=0; for(int j=0;j<n;j++){ bir+=arr[j][i]; } if(bir>n-bir){ for(int j=0;j<n;j++){ arr[j][i]^=1; } } } for(int i=0;i<n;i++){ int bir=0; for(int j=0;j<n;j++){ bir+=arr[i][j]; } if(bir>n-bir){ for(int j=0;j<n;j++){ arr[i][j]^=1; } } } } int bir=0; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ bir+=arr[i][j]; } } if(bir>n*n-bir)bir=n*n-bir; if(bir<=k)cout<<"DA"<<endl; else cout<<"NE"<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 4 ms | 980 KB | Output is correct |
3 | Correct | 5 ms | 1236 KB | Output is correct |
4 | Correct | 15 ms | 3520 KB | Output is correct |
5 | Correct | 5 ms | 1236 KB | Output is correct |
6 | Correct | 2 ms | 596 KB | Output is correct |
7 | Incorrect | 5 ms | 1256 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Incorrect | 0 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2496 KB | Output is correct |
2 | Correct | 12 ms | 2992 KB | Output is correct |
3 | Correct | 8 ms | 2004 KB | Output is correct |
4 | Correct | 7 ms | 1872 KB | Output is correct |
5 | Correct | 14 ms | 3476 KB | Output is correct |
6 | Incorrect | 5 ms | 1364 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 3156 KB | Output is correct |
2 | Correct | 13 ms | 3156 KB | Output is correct |
3 | Correct | 8 ms | 1932 KB | Output is correct |
4 | Correct | 10 ms | 2404 KB | Output is correct |
5 | Correct | 11 ms | 2544 KB | Output is correct |
6 | Incorrect | 17 ms | 3924 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 1876 KB | Output is correct |
2 | Correct | 8 ms | 1876 KB | Output is correct |
3 | Correct | 18 ms | 4088 KB | Output is correct |
4 | Correct | 6 ms | 1364 KB | Output is correct |
5 | Correct | 8 ms | 1876 KB | Output is correct |
6 | Incorrect | 17 ms | 3924 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 4180 KB | Output is correct |
2 | Correct | 17 ms | 4012 KB | Output is correct |
3 | Correct | 16 ms | 3668 KB | Output is correct |
4 | Correct | 11 ms | 2388 KB | Output is correct |
5 | Correct | 11 ms | 2384 KB | Output is correct |
6 | Incorrect | 10 ms | 2516 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |