oj.uz

답안 #1016620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016620 2024-07-08T09:19:38 Z ByeWorld Lasers (NOI19_lasers) C++14
21 / 100
 1000 ms 19656 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmx(int &a, int b){ a = max(a, b); }

int n, num, k[MAXN];
vector <int> vec[MAXN];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> num;
    for(int i=1; i<=num; i++){
        cin >> k[i]; vec[i].pb(-1);
        for(int j=1; j<=k[i]; j++){
            int p; cin >> p; vec[i].pb(p);
        }
    }
    int ANS = 0;
    for(int i=1; i<=n; i++){
        int L = i-1, R = n-i;
        bool kena = 0;
        for(int j=1; j<=num; j++){
            int tot = 0, idx = 1;
            while(idx<vec[j].size() && tot+vec[j][idx] <= L){
                tot += vec[j][idx++];
            } 
            int oth = 0;
            for(int p=idx; p<vec[j].size(); p++) oth += vec[j][p];
            if(oth > R) kena = 1;
        }
        ANS += kena;
    }
    cout << ANS << '\n';
}

Compilation message

lasers.cpp: In function 'int main()':
lasers.cpp:45:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             while(idx<vec[j].size() && tot+vec[j][idx] <= L){
      |                   ~~~^~~~~~~~~~~~~~
lasers.cpp:49:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             for(int p=idx; p<vec[j].size(); p++) oth += vec[j][p];
      |                            ~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 12892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 12892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1028 ms 19656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 4 ms 12892 KB Output is correct
8 Correct 4 ms 12892 KB Output is correct
9 Correct 5 ms 12892 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1028 ms 19656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 12892 KB Time limit exceeded
2 Halted 0 ms 0 KB -