oj.uz

Submission #239120

# Submission time Handle Problem Language Result Execution time Memory
239120 2020-06-14T13:28:12 Z Dynamic_Cast Lasers (NOI19_lasers) C++14
45 / 100
 1000 ms 33292 KB 
//#include <bits/stdc++.h> C++11
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <time.h>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <stack>
#include <queue>
#include <climits>
#include <map>
#include <set>
#include <sstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int L, R, X, temp;
    cin >> L >> R;
    vi append;
    vector<vi> wall;
    int flag, maxx;
    flag = 1;
    maxx = 0;
    for (int i = 0; i < R; i++)
    {
        cin >> X;
        if (X > 1)
        {
            flag = 0;
        }
        for (int j = 0; j < X; j++)
        {
            cin >> temp;
            maxx = max(maxx, temp);
            append.PB(temp);
        }
        wall.PB(append);
        append.clear();
        
    }
    
    if (flag == 1)
    {
        cout << max(2 * maxx - L, 0) << "\n";
    }
    if (flag == 0)
    {
        int count = 0;
        for (int i = 0; i < R; i++)
        {
            for (int j = 1; j < int(wall[i].size()); j++)
            {
                wall[i][j] += wall[i][j - 1];
                //cout<<wall[i][j]<<"\n";
            }
        }
        int f2 = 0;
        for (int i = 0; i < L; i++)
        {
            for (int j = 0; j < R; j++)
            {
                f2 = 0;
                if ((wall[j][int(wall[j].size()) - 1]) < L - i)
                {
                    f2 = 1;
                    continue;
                }
                for (int k = 0; k < int(wall[j].size()); k++)
                {
                    if (wall[j][k] <= i && (wall[j][int(wall[j].size()) - 1] - wall[j][k]) < L - i)
                    {
                        f2 = 1;
                        break;
                    }
                }
                if (f2 == 0)
                {
                    count++;
                    //cout << "laser " << i << " cant pass through row " << j << "\n";
                    break;
                }
            }
        }
        cout << count << "\n";
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 157 ms 33008 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 158 ms 33292 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 2936 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 2936 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 157 ms 33008 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 158 ms 33292 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Execution timed out 1094 ms 2936 KB Time limit exceeded
22 Halted 0 ms 0 KB -