oj.uz

Submission #417671

# Submission time Handle Problem Language Result Execution time Memory
417671 2021-06-04T06:11:36 Z 장태환(#7548) Parking Problem (innopolis2021_final_A) C++17
54 / 100
 95 ms 852 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int T;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> T;
    while(T--)
    {
        string a,b;
        cin >> a >> b ;
        int i;
        int c=0;
        priority_queue<int>oo,ee;
        for(i=0;i<a.size();i++)
        {
            if(a[i]=='X')
            {
                if(c>1)
                {
                    if(c%2)
                        ee.push(c-1);
                    else
                        oo.push(c-1);
                }
                c=0;
            }
            else
                c++;
        }
        if(c>1)
        {
            if(c%2)
                ee.push(c-1);
            else
                oo.push(c-1);
        }
        int s=0,en=b.size()+1;
        while(s!=en)
        {
            priority_queue<int>o,e;
            o=oo;
            e=ee;
            int m=(s+en)/2;
            int three=0,two=0;
            for(i=0;i<m;i++)
            {
                if(b[i]=='M')
                    two++;
                else
                    three++;
            }
            for(i=0;i<three+two;i++)
            {
                if(i>=three)
            {
                if(e.size())
                {
                    if(e.top()>2)
                        e.push(e.top()-2);
                    e.pop();
                }
                else if(o.size())
                {
                    if(o.top()>2)
                        o.push(o.top()-2);
                    o.pop();
                }
            }
            else
            {
                if(o.size())
                {
                    if(o.top()>3)
                        e.push(o.top()-3);
                    o.pop();
                }
                else if(e.size())
                {
                    if(e.top()>3)
                        o.push(e.top()-3);
                    e.pop();
                }
            }

        }
            if(e.size()||o.size())
                s=m+1;
            else
                en=m;
        }
        for(i=0;i<s;i++)
            cout <<'Y';
        for(i=s;i<=b.size();i++)
            cout <<'N';
        cout <<'\n';
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:16:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(i=0;i<a.size();i++)
      |                 ~^~~~~~~~~
Main.cpp:95:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for(i=s;i<=b.size();i++)
      |                 ~^~~~~~~~~~

Subtask #1
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 716 KB Output is correct
2 Correct 25 ms 448 KB Output is correct
3 Correct 43 ms 624 KB Output is correct
4 Correct 51 ms 784 KB Output is correct
5 Correct 25 ms 456 KB Output is correct
6 Correct 48 ms 852 KB Output is correct
7 Correct 26 ms 460 KB Output is correct
8 Correct 47 ms 664 KB Output is correct
9 Correct 34 ms 740 KB Output is correct
10 Correct 24 ms 460 KB Output is correct
11 Correct 47 ms 544 KB Output is correct
12 Correct 28 ms 664 KB Output is correct
13 Correct 22 ms 512 KB Output is correct
14 Correct 43 ms 656 KB Output is correct
15 Correct 34 ms 588 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 848 KB Output is correct
2 Correct 37 ms 548 KB Output is correct
3 Correct 47 ms 636 KB Output is correct
4 Correct 45 ms 724 KB Output is correct
5 Incorrect 27 ms 460 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 796 KB Output is correct
2 Correct 65 ms 572 KB Output is correct
3 Correct 43 ms 572 KB Output is correct
4 Correct 33 ms 524 KB Output is correct
5 Correct 34 ms 476 KB Output is correct
6 Correct 38 ms 580 KB Output is correct
7 Correct 43 ms 720 KB Output is correct
8 Correct 50 ms 592 KB Output is correct
9 Correct 32 ms 460 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 716 KB Output is correct
2 Correct 25 ms 448 KB Output is correct
3 Correct 43 ms 624 KB Output is correct
4 Correct 51 ms 784 KB Output is correct
5 Correct 25 ms 456 KB Output is correct
6 Correct 48 ms 852 KB Output is correct
7 Correct 26 ms 460 KB Output is correct
8 Correct 47 ms 664 KB Output is correct
9 Correct 34 ms 740 KB Output is correct
10 Correct 24 ms 460 KB Output is correct
11 Correct 47 ms 544 KB Output is correct
12 Correct 28 ms 664 KB Output is correct
13 Correct 22 ms 512 KB Output is correct
14 Correct 43 ms 656 KB Output is correct
15 Correct 34 ms 588 KB Output is correct
16 Correct 43 ms 848 KB Output is correct
17 Correct 37 ms 548 KB Output is correct
18 Correct 47 ms 636 KB Output is correct
19 Correct 45 ms 724 KB Output is correct
20 Incorrect 27 ms 460 KB Output isn't correct
21 Halted 0 ms 0 KB -