oj.uz

답안 #477867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477867 2021-10-04T09:40:43 Z sumit_kk10 지구 온난화 (NOI13_gw) C++17
12 / 40
 1000 ms 24628 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
 
void solve(){
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    vector<pair<long long, int> > comp;
    for(int i = 0; i < a.size(); ++i)
        comp.push_back({a[i], i});
    sort(comp.begin(), comp.end());
    int ct = 1;
    a[comp[0].second] = ct;
    for(int i = 1; i < comp.size(); ++i){
        if(comp[i].first != comp[i - 1].first)
            ++ct;
        a[comp[i].second] = ct;
    }
    int ans = 0;
    for(int i = 1; i <= ct; ++i){
        int x = 0;
        for(int j = 0; j < n; ++j){
            int cur = j;
            while(a[cur] > i and j < n)
                ++cur;
            if(cur != j){
                j = cur - 1;
                ++x;
            }
        }
        ans = max(ans, x);
    }
    cout << ans << "\n";
}
 
int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

Compilation message

gw.cpp: In function 'void solve()':
gw.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i = 0; i < a.size(); ++i)
      |                    ~~^~~~~~~~~~
gw.cpp:21:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i = 1; i < comp.size(); ++i){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 3272 KB Output is correct
2 Correct 30 ms 3272 KB Output is correct
3 Correct 27 ms 3272 KB Output is correct
4 Correct 29 ms 3252 KB Output is correct
5 Correct 27 ms 3280 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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