oj.uz

답안 #974893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974893 2024-05-04T06:29:24 Z rahidilbayramli Memory (IOI10_memory) C++17
0 / 100
 1 ms 344 KB 
#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void play()
{
    map<char, pll>mp;
    for(char c = 'A'; c <= 'Z'; c++)
        mp[c] = {-1, -1};
    for(int i = 1; i <= 50; i++)
    {
        char a = faceup(i);
        if(mp[a].f == -1)
            mp[a].f = i;
        else
            mp[a].s = i;
    }
    for(auto u : mp)
    {
        ll x = u.s.f, y = u.s.s;
        char a = faceup(x);
        char b = faceup(y);
    }
}

Compilation message

memory.cpp: In function 'void play()':
memory.cpp:35:14: warning: unused variable 'a' [-Wunused-variable]
   35 |         char a = faceup(x);
      |              ^
memory.cpp:36:14: warning: unused variable 'b' [-Wunused-variable]
   36 |         char b = faceup(y);
      |              ^

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -