QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#871613#8619. Interactive Casinoucup-team139#TL 0ms0kbC++231.2kb2025-01-25 21:19:142025-01-25 21:19:15

Judging History

你现在查看的是最新测评结果

  • [2025-01-25 21:19:15]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2025-01-25 21:19:14]
  • 提交

answer

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <climits>
#include <iomanip>
using namespace std;

void solve([[maybe_unused]] int t)
{
  int n;
  cin >> n;
  for (int i = 0; i < n; i++)
  {
    int m, b;
    string s;
    cin >> s;

    if (s != "ROUND")
    {
      return;
    }

    cin >> m >> b;

    if (m <= b / 10)
    {
      cout << "PLAY\n";
    }
    else
    {
      cout << "SKIP\n";
    }
  }
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n = 1;
  // cin >> n;
  for (int i = 1; i <= n; i++)
    solve(i);
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Time Limit Exceeded

input:

5
ROUND 1000 43

output:


result: