oj.uz

Submission #471001

# Submission time Handle Problem Language Result Execution time Memory
471001 2021-09-06T15:05:46 Z myvaluska T-Covering (eJOI19_covering) C++14
5 / 100
 265 ms 7936 KB 
// game.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
// ttetris.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int m;
    cin >> m;
    vector<vector<int>>v(n + 2, vector<int>(m + 2, -10000036));
    for (int i = 1; i < n + 1; i++)
    {
        for (int j = 1; j < m + 1; j++)
        {
            cin >> v[i][j];
        }
    }
    int flag = 0;
    int vys = 0;
    int q;
    cin >> q;
    while (q--)
    {
        int i;
        cin >> i;
        int j;
        cin >> j;
        i += 1;
        j += 1;
        int vys1 = -1;
        int vys2 = -1;
        int vys3 = -1;
        int vys4 = -1;
        vys1 = v[i][j] + v[i - 1][j] + v[i + 1][j] + v[i][j + 1];
        vys2 = v[i][j] + v[i - 1][j] + v[i + 1][j] + v[i][j - 1];
        vys3 = v[i][j] + v[i][j + 1] + v[i][j - 1] + v[i - 1][j];
        vys4 = v[i][j] + v[i][j + 1] + v[i][j - 1] + v[i + 1][j];
        if (max({ vys1,vys2,vys3,vys4 }) < 0)
        {
            flag = 1;
        }
        else
        {
            vys += max({ vys1,vys2,vys3,vys4 });
        }
    }
    if (flag == 0)
    {
        cout << vys << endl;
    }
    else
    {
        cout << "No" << endl;
    }
    return 0;
    //std::cout << "Hello World!\n";
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 8 ms 540 KB Output is correct
3 Correct 25 ms 1068 KB Output is correct
4 Correct 89 ms 2620 KB Output is correct
5 Correct 265 ms 7936 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Incorrect 8 ms 532 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 372 KB Output is correct
2 Incorrect 8 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Incorrect 1 ms 292 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 8 ms 540 KB Output is correct
3 Correct 25 ms 1068 KB Output is correct
4 Correct 89 ms 2620 KB Output is correct
5 Correct 265 ms 7936 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Incorrect 8 ms 532 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 8 ms 540 KB Output is correct
3 Correct 25 ms 1068 KB Output is correct
4 Correct 89 ms 2620 KB Output is correct
5 Correct 265 ms 7936 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Incorrect 8 ms 532 KB Output isn't correct
8 Halted 0 ms 0 KB -