oj.uz

Submission #994826

# Submission time Handle Problem Language Result Execution time Memory
994826 2024-06-08T06:57:21 Z 김은성(#10865) Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 348 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int l[1009], r[1009], i;
bool consecutive(vector<int> vec){
    int i;
    for(i=0; i+1<vec.size(); i++){
        if(vec[i+1] != vec[i] + 1)
            return false;
    }
    return true;
}
bool bitonic(vector<int> vec){
    int i, trend = 0;
    for(i=0; i+1<vec.size(); i++){
        //printf("vec=%d %d trend=%d\n", vec[i], vec[i+1], trend);
        if(vec[i] < vec[i+1] && trend)
            return false;
        if(vec[i] > vec[i+1])
            trend = 1;
    }
    return true;
}
pair<int, int> change_trend(vector<int> vec){
    int i;
    vector<int> opt;
    int mx = -12839423;
    for(i=0; i<vec.size(); i++){
        if(vec[i] > mx){
            opt.clear();
            opt.push_back(i);
        }
        else if(vec[i] == mx)
            opt.push_back(i);
    }
    return make_pair(opt[0], opt.back());
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    vector<int> temp, lt, rt;
    int i, j, cnt=0, n=N;
    for(i=0; i<N; i++){
        vector<int> f;
        for(j=0; j<N; j++){
            if(!F[i][j])
                f.push_back(j), cnt++;
        }
        if(!f.empty()){
            if(!consecutive(f))
                return 0;
            temp.push_back(i);
            lt.push_back(-f[0]);
            rt.push_back(f.back());
        }
    }
    if(!consecutive(temp))
        return 0;
    if(!bitonic(lt))
        return 0;
    if(!bitonic(rt))
        return 0;
    pair<int,int> r1 = change_trend(lt);
    pair<int,int> r2 = change_trend(rt);
    if(r2.second < r1.first || r1.second < r2.first)
        return 0;
    for(i=0; i<n; i++){
        for(j=i+1; j<n; j++){
            swap(F[i][j], F[j][i]);
        }
    }
    for(i=0; i<N; i++){
        vector<int> f;
        for(j=0; j<N; j++){
            if(!F[i][j])
                f.push_back(j), cnt++;
        }
        if(!f.empty()){
            if(!consecutive(f))
                return 0;
            temp.push_back(i);
            lt.push_back(-f[0]);
            rt.push_back(f.back());
        }
    }
    if(!consecutive(temp))
        return 0;
    if(!bitonic(lt))
        return 0;
    if(!bitonic(rt))
        return 0;
    r1 = change_trend(lt);
    r2 = change_trend(rt);
    if(r2.second < r1.first || r1.second < r2.first)
        return 0;
    return cnt;
}

Compilation message

soccer.cpp: In function 'bool consecutive(std::vector<int>)':
soccer.cpp:7:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for(i=0; i+1<vec.size(); i++){
      |              ~~~^~~~~~~~~~~
soccer.cpp: In function 'bool bitonic(std::vector<int>)':
soccer.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(i=0; i+1<vec.size(); i++){
      |              ~~~^~~~~~~~~~~
soccer.cpp: In function 'std::pair<int, int> change_trend(std::vector<int>)':
soccer.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(i=0; i<vec.size(); i++){
      |              ~^~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB wrong
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB wrong
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -