oj.uz

Submission #939104

# Submission time Handle Problem Language Result Execution time Memory
939104 2024-03-06T05:44:22 Z gaga999 Slon (COCI15_slon) C++17
0 / 120
 10 ms 860 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
int M;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 1e5 + 5;
char s[N], *p;

pii operator+(const pii &a, const pii &b)
{
    return pii(a.F + b.F, a.S + b.S);
}

pii operator-(const pii &a, const pii &b)
{
    return pii(a.F - b.F, a.S - b.S);
}

pii operator*(const pii &a, const pii &b)
{
    if (!a.F)
        return pii(ml(b.F, a.S), ml(b.S, a.S));
    return pii(ml(a.F, b.S), ml(a.S, b.S));
}

pii sk[N];
int ar[N], top;
char ch[N];

inline void pop(pii &cr)
{
    switch (ch[top])
    {
    case '-':
        cr = sk[top--] - cr;
        break;
    case '+':
        cr = sk[top--] + cr;
        break;
    default:
        cr = sk[top--] * cr;
        break;
    }
}

pii slv()
{
    for (;;)
    {
        while (*p == '(')
            ar[top]++, p++;
        pii cr(0, 0);
        if (*p == 'x')
            cr.F = 1, p++;
        else
        {
            int fg = 1;
            if (*p == '-')
                fg = M - 1, p++;
            while (isdigit(*p))
                cr.S = (cr.S * 10 + *p++ - '0') % M;
            tml(cr.S, fg);
        }
        //----------
        while (*p == ')')
        {
            while (!ar[top])
                pop(cr);
            ar[top]--, p++;
        }
        if (!*p)
        {
            while (top)
                pop(cr);
            return cr;
        }
        char c = ch[top];
        pii pr = sk[top];
        top--;
        while (top > 0 && !ar[top] && (ch[top] == '*' || *p != '*'))
            pop(pr);
        ch[++top] = c, sk[top] = pr;
        ch[++top] = *p++, sk[top] = cr;
    }
}

signed main()
{
    int res;
    scanf("%s%d%d", p = s, &res, &M);
    pii cr = slv();
    for (int i = 0; i < M; i++)
    {
        if (ad(ml(cr.F, i), cr.S) == res)
        {
            prt(i), putchar('\n');
            exit(0);
        }
    }
}

Compilation message

slon.cpp: In function 'int main()':
slon.cpp:196:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  196 |     scanf("%s%d%d", p = s, &res, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 120.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 344 KB Output isn't correct
2 Runtime error 5 ms 860 KB Execution killed with signal 11
3 Incorrect 1 ms 348 KB Output isn't correct
4 Incorrect 7 ms 348 KB Output isn't correct
5 Runtime error 4 ms 604 KB Execution killed with signal 11
6 Incorrect 10 ms 348 KB Output isn't correct
7 Runtime error 5 ms 604 KB Execution killed with signal 11
8 Runtime error 4 ms 604 KB Execution killed with signal 11
9 Incorrect 6 ms 348 KB Output isn't correct
10 Incorrect 2 ms 348 KB Output isn't correct