Submission #794478

# Submission time Handle Problem Language Result Execution time Memory
794478 2023-07-26T14:54:31 Z AndrijaM T-Covering (eJOI19_covering) C++14
0 / 100
1 ms 392 KB
#include <bits/stdc++.h>

using namespace std;

const long long maxn=1e9 - 7;

int main()
{
    ios::sync_with_stdio(0);
    int n,m;
    cin>>n>>m;
    int mat[n][m];
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin>>mat[i][j];
        }
    }
    int k;
    cin>>k;
    vector<pair<int,int>>v;
    for(int i=0;i<k;i++)
    {
        int x,y;
        cin>>x>>y;
        v.push_back({x,y});
    }
    cout<<"No"<<endl;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 392 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -