oj.uz

답안 #145926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145926 2019-08-21T11:36:13 Z youssan_william Preokret (COCI18_preokret) C++14
16.4 / 50
 4 ms 504 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int main()
{
    ll a , b;
    cin >> a;
    ll arr[a];
    ll mid=1440;
    map<ll,char>mp;
    vector<ll>goals;
    for(int i = 0 ; i < a ;i++)
    {
        cin >> arr[i];
        goals.push_back(arr[i]);
        mp[arr[i]]='a';
    }
    cin >> b;
    ll arr2[b];
    for(int i = 0 ; i < b ;i++)
    {
        cin >> arr2[i];
        goals.push_back(arr2[i]);
        mp[arr2[i]]='b';
    }
    sort(goals.begin(),goals.end());
    int ans=0 , teamA=0 , teamB=0 , turnarounds=0,loser=-1, newloser;
    for(int i = 0 ; i < goals.size() ;i++)
    {
        if(mp[goals[i]]=='a')
            teamA++;
        else teamB++;
        if(teamA!=teamB&&teamA!=0&&teamB!=0)
        {
            if(teamA>teamB) newloser=1;
            else newloser=0;
            if(newloser!=loser)
            {
                loser=newloser;
                turnarounds++;
            }
        }
        if(goals[i]<=mid)
            ans++;

    }
    cout << ans << "\n" << turnarounds ;
    return 0;
}

Compilation message

preokret.cpp: In function 'int main()':
preokret.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0 ; i < goals.size() ;i++)
                     ~~^~~~~~~~~~~~~~

Subtask #1
16.4 / 50.0

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