oj.uz

답안 #1090894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090894 2024-09-19T05:27:43 Z KasymK Exam (eJOI20_exam) C++17
0 / 100
 4 ms 948 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
int a[N], b[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        a[i] = x;
    }
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        b[i] = x;
    }
    bool ok = 1;
    for(int i = 1; i < n and ok; ++i)
        ok &= (b[i] == b[i+1]);
    if(ok){ // subtask 2
        int need = b[1];
        int answer = 0;
        if((int)count(a+1, a+n+1, need) == 0){
            puts("0");
            return 0;
        }
        for(int i = 1; i <= n; ++i){
            bool have = 0;
            int id = -1;
            for(int j = i; j <= n; ++j){
                id = j;
                if(a[j] > need)
                    break;
                have |= (a[j] == need);
            }
            if(have)
                answer += (id-i);
            i = id;
        }
        printf("%d\n", answer);
        return 0;
    }
    return 0;
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
exam.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
exam.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 4 ms 948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -