oj.uz

Submission #98785

# Submission time Handle Problem Language Result Execution time Memory
98785 2019-02-25T21:20:56 Z bogdan10bos Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
0 / 100
 500 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef pair<int, int> pii;

int N;
string s;
vector<pii> v;

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
    #endif

    cin >> N;
    cin >> s;

    for(int i = 0; i < N; i++)
        v.push_back({s[i], i});

    for(int i = 1; i < N; i++)
    {
        if(v[i].first != v[i - 1].first)    continue;
        for(int j = i + 1; j < N; j++)
            if(v[j].first != v[i].first)
            {
                while(j > i)
                {
                    swap(v[j], v[j - 1]);
                    j--;
                }
                break;
            }
    }
    for(int i = N - 1; i > 0; i--)
    {
        if(v[i].first != v[i - 1].first)    continue;
        for(int j = i - 2; j >= 0; j--)
            if(v[j].first != v[i].first)
            {
                while(j < i - 1)
                {
                    swap(v[j], v[j + 1]);
                    j++;
                }
            }
    }

    int ans = 0;
    for(int i = 0; i < v.size(); i++)
        if(v[i].second > i)
            ans += v[i].second - i;

    cout << ans << '\n';

    return 0;
}

Compilation message

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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Execution timed out 1055 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Execution timed out 1055 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Execution timed out 1055 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -