oj.uz

Submission #417685

# Submission time Handle Problem Language Result Execution time Memory
417685 2021-06-04T06:36:28 Z 장태환(#7548) Parking Problem (innopolis2021_final_A) C++17
54 / 100
 103 ms 824 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;
        priority_queue<int,vector<int>,greater<int>>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;
            priority_queue<int,vector<int>,greater<int>>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())
                {
                    int c=e.top()-2;
                    e.pop();
                      if(c>0)
                        e.push(c);
                }
                else if(o.size())
                {
                 int c=o.top()-2;

                    o.pop();
                     if(c>0)
                        o.push(c);
                }
            }
            else
            {
                if(o.size())
                {
                     int c=o.top()-3;

                    o.pop();
                     if(c>0)
                        e.push(c);
                }
                else if(e.size())
                {
                   int c=e.top()-3;
                    e.pop();
                      if(c>0)
                        o.push(c);
                }
            }

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

Subtask #1
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 720 KB Output is correct
2 Correct 20 ms 532 KB Output is correct
3 Correct 36 ms 552 KB Output is correct
4 Correct 42 ms 776 KB Output is correct
5 Correct 21 ms 528 KB Output is correct
6 Correct 40 ms 824 KB Output is correct
7 Correct 22 ms 476 KB Output is correct
8 Correct 39 ms 584 KB Output is correct
9 Correct 32 ms 744 KB Output is correct
10 Correct 24 ms 508 KB Output is correct
11 Correct 44 ms 660 KB Output is correct
12 Correct 27 ms 792 KB Output is correct
13 Correct 22 ms 592 KB Output is correct
14 Correct 43 ms 648 KB Output is correct
15 Correct 34 ms 456 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 792 KB Output is correct
2 Correct 24 ms 576 KB Output is correct
3 Correct 52 ms 580 KB Output is correct
4 Correct 35 ms 736 KB Output is correct
5 Incorrect 23 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 103 ms 712 KB Output is correct
2 Correct 71 ms 672 KB Output is correct
3 Correct 44 ms 588 KB Output is correct
4 Correct 38 ms 532 KB Output is correct
5 Correct 31 ms 572 KB Output is correct
6 Correct 35 ms 672 KB Output is correct
7 Correct 39 ms 612 KB Output is correct
8 Correct 42 ms 652 KB Output is correct
9 Correct 31 ms 460 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 720 KB Output is correct
2 Correct 20 ms 532 KB Output is correct
3 Correct 36 ms 552 KB Output is correct
4 Correct 42 ms 776 KB Output is correct
5 Correct 21 ms 528 KB Output is correct
6 Correct 40 ms 824 KB Output is correct
7 Correct 22 ms 476 KB Output is correct
8 Correct 39 ms 584 KB Output is correct
9 Correct 32 ms 744 KB Output is correct
10 Correct 24 ms 508 KB Output is correct
11 Correct 44 ms 660 KB Output is correct
12 Correct 27 ms 792 KB Output is correct
13 Correct 22 ms 592 KB Output is correct
14 Correct 43 ms 648 KB Output is correct
15 Correct 34 ms 456 KB Output is correct
16 Correct 34 ms 792 KB Output is correct
17 Correct 24 ms 576 KB Output is correct
18 Correct 52 ms 580 KB Output is correct
19 Correct 35 ms 736 KB Output is correct
20 Incorrect 23 ms 460 KB Output isn't correct
21 Halted 0 ms 0 KB -