oj.uz

Submission #776280

# Submission time Handle Problem Language Result Execution time Memory
776280 2023-07-07T14:21:42 Z marvinthang Misspelling (JOI22_misspelling) C++17
100 / 100
 487 ms 195368 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.07.2023 20:02:37    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

const int MOD = 1e9 + 7;

namespace Mod {

    inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) {
        unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
    #ifdef __GNUC__
        asm(
            "divl %4 \n\t"
            : "=a" (d), "=d" (m)
            : "d" (xh), "a" (xl), "r" (y)
        );
    #else
        __asm {
            mov edx, dword ptr[xh];
            mov eax, dword ptr[xl];
            div dword ptr[y];
            mov dword ptr[d], eax;
            mov dword ptr[m], edx;
        };
    #endif
        out_d = d; out_m = m;
    }

    template <class T> T invGeneral(T a, T b) {
        a %= b;
        if (!a) return b == 1 ? 0 : -1;
        T x = invGeneral(b, a);
        return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b;
    }

    template <int MOD>
    struct ModInt {
        
        unsigned int val;

        ModInt(void): val(0) {}
        ModInt(const long long &x) { *this = x; }

        ModInt & normalize(const unsigned int &v) {
            val = v >= MOD ? v - MOD : v;
            return *this;
        }

        bool operator ! (void) { return !val; }

        ModInt & operator = (const ModInt &x) { val = x.val; return *this; }
        ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); }

        ModInt operator - (void) { return ModInt(MOD - val); }

        ModInt & operator += (const ModInt &other) { return normalize(val + other.val); }
        ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); }
        ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); }

        ModInt & operator *= (const ModInt &other) {
            unsigned dummy;
            fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val);
            return *this;
        }

        ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; }
        ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; }
        ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; }
        ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; }

        ModInt pow(long long n) const {
            assert(n >= 0);
            ModInt res = 1, a = *this;
            for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
            return res;
        }

        ModInt inv(void) const {
            int i = invGeneral((int) val, MOD);
            assert(~i);
            return i;
        }

        ModInt & operator ++ (void) { return *this += 1; }
        ModInt & operator -- (void) { return *this -= 1; }
        ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; }
        ModInt operator -- (int) { ModInt old = *this; operator --(); return old; }

        friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; }
        friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; }
        friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; }
        friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; }
        friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; }
        friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; }

        bool operator < (const ModInt &other) const { return val < other.val; }
        bool operator > (const ModInt &other) const { return val > other.val; }
        bool operator <= (const ModInt &other) const { return val <= other.val; }
        bool operator >= (const ModInt &other) const { return val >= other.val; }
        bool operator == (const ModInt &other) const { return val == other.val; }
        bool operator != (const ModInt &other) const { return val != other.val; }
        explicit operator bool(void) const { return val; }
        explicit operator int(void) const { return val; }

    };  

    using Modular = ModInt <MOD>;

}

using namespace Mod;

// end of template

const int MAX = 5e5 + 5;

int N, M, L[MAX], R[MAX];
Modular dp[MAX][26], pref[MAX][27];
vector <int> add[MAX][2], rem[MAX][2];
bool used[MAX];

void init(void) {
	cin >> N >> M;
	REP(i, M) {
		cin >> L[i] >> R[i];
		if (L[i] < R[i]) {
			add[L[i]][0].push_back(i);
			rem[R[i]][0].push_back(i);
		} else {
            swap(L[i], R[i]);
			add[L[i]][1].push_back(i);
			rem[R[i]][1].push_back(i);
		}
	}
}

void process(void) {
	stack <int> st[2];
	FORE(i, 1, N) {
		REP(j, 2) while (!st[j].empty() && used[st[j].top()]) st[j].pop();
		int p0 = st[0].empty() ? 0 : L[st[0].top()];
		int p1 = st[1].empty() ? 0 : L[st[1].top()];
		REP(j, 26) {
			dp[i][j] = i == 1;
			dp[i][j] += (pref[i - 1][26] - pref[i - 1][j + 1] + pref[i - 1][j]) - (pref[max(p0, p1)][26] - pref[max(p0, p1)][j + 1] + pref[max(p0, p1)][j]);
			if (p0 < p1) dp[i][j] += pref[p1][j] - pref[p0][j];
            else if (p1 < p0) dp[i][j] += (pref[p0][26] - pref[p0][j + 1]) - (pref[p1][26] - pref[p1][j + 1]);
			pref[i][j + 1] = pref[i][j] + dp[i][j];
		}
        REP(j, 26) pref[i][j + 1] += pref[i - 1][j + 1];
		REP(j, 2) {
			for (int k: add[i][j]) st[j].push(k);
			for (int k: rem[i][j]) used[k] = true;
		}
	}
	cout << pref[N][26] << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("misspelling");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
misspelling.cpp:199:2: note: in expansion of macro 'file'
  199 |  file("misspelling");
      |  ^~~~
misspelling.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
misspelling.cpp:199:2: note: in expansion of macro 'file'
  199 |  file("misspelling");
      |  ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 150932 KB Output is correct
2 Correct 51 ms 150956 KB Output is correct
3 Correct 50 ms 150912 KB Output is correct
4 Correct 50 ms 150996 KB Output is correct
5 Correct 51 ms 150940 KB Output is correct
6 Correct 51 ms 150988 KB Output is correct
7 Correct 51 ms 150932 KB Output is correct
8 Correct 53 ms 150920 KB Output is correct
9 Correct 58 ms 150940 KB Output is correct
10 Correct 51 ms 150980 KB Output is correct
11 Correct 51 ms 150936 KB Output is correct
12 Correct 51 ms 150916 KB Output is correct
13 Correct 51 ms 150944 KB Output is correct
14 Correct 51 ms 150888 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 150932 KB Output is correct
2 Correct 51 ms 150956 KB Output is correct
3 Correct 50 ms 150912 KB Output is correct
4 Correct 50 ms 150996 KB Output is correct
5 Correct 51 ms 150940 KB Output is correct
6 Correct 51 ms 150988 KB Output is correct
7 Correct 51 ms 150932 KB Output is correct
8 Correct 53 ms 150920 KB Output is correct
9 Correct 58 ms 150940 KB Output is correct
10 Correct 51 ms 150980 KB Output is correct
11 Correct 51 ms 150936 KB Output is correct
12 Correct 51 ms 150916 KB Output is correct
13 Correct 51 ms 150944 KB Output is correct
14 Correct 51 ms 150888 KB Output is correct
15 Correct 55 ms 151152 KB Output is correct
16 Correct 51 ms 150988 KB Output is correct
17 Correct 52 ms 150928 KB Output is correct
18 Correct 51 ms 151004 KB Output is correct
19 Correct 51 ms 151000 KB Output is correct
20 Correct 52 ms 150972 KB Output is correct
21 Correct 52 ms 150976 KB Output is correct
22 Correct 53 ms 151292 KB Output is correct
23 Correct 52 ms 150996 KB Output is correct
24 Correct 53 ms 150984 KB Output is correct
25 Correct 52 ms 150980 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 150960 KB Output is correct
2 Correct 51 ms 150988 KB Output is correct
3 Correct 52 ms 150960 KB Output is correct
4 Correct 51 ms 150892 KB Output is correct
5 Correct 258 ms 194844 KB Output is correct
6 Correct 260 ms 194812 KB Output is correct
7 Correct 254 ms 194940 KB Output is correct
8 Correct 255 ms 195144 KB Output is correct
9 Correct 254 ms 194888 KB Output is correct
10 Correct 62 ms 152652 KB Output is correct
11 Correct 55 ms 151016 KB Output is correct
12 Correct 54 ms 150964 KB Output is correct
13 Correct 455 ms 195368 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 150932 KB Output is correct
2 Correct 51 ms 150956 KB Output is correct
3 Correct 50 ms 150912 KB Output is correct
4 Correct 50 ms 150996 KB Output is correct
5 Correct 51 ms 150940 KB Output is correct
6 Correct 51 ms 150988 KB Output is correct
7 Correct 51 ms 150932 KB Output is correct
8 Correct 53 ms 150920 KB Output is correct
9 Correct 58 ms 150940 KB Output is correct
10 Correct 51 ms 150980 KB Output is correct
11 Correct 51 ms 150936 KB Output is correct
12 Correct 51 ms 150916 KB Output is correct
13 Correct 51 ms 150944 KB Output is correct
14 Correct 51 ms 150888 KB Output is correct
15 Correct 55 ms 151152 KB Output is correct
16 Correct 51 ms 150988 KB Output is correct
17 Correct 52 ms 150928 KB Output is correct
18 Correct 51 ms 151004 KB Output is correct
19 Correct 51 ms 151000 KB Output is correct
20 Correct 52 ms 150972 KB Output is correct
21 Correct 52 ms 150976 KB Output is correct
22 Correct 53 ms 151292 KB Output is correct
23 Correct 52 ms 150996 KB Output is correct
24 Correct 53 ms 150984 KB Output is correct
25 Correct 52 ms 150980 KB Output is correct
26 Correct 60 ms 152668 KB Output is correct
27 Correct 65 ms 151892 KB Output is correct
28 Correct 60 ms 151756 KB Output is correct
29 Correct 63 ms 152476 KB Output is correct
30 Correct 63 ms 152496 KB Output is correct
31 Correct 155 ms 169988 KB Output is correct
32 Correct 60 ms 152652 KB Output is correct
33 Correct 60 ms 152652 KB Output is correct
34 Correct 63 ms 152296 KB Output is correct
35 Correct 164 ms 170580 KB Output is correct
36 Correct 56 ms 150956 KB Output is correct
37 Correct 62 ms 152004 KB Output is correct
38 Correct 62 ms 151720 KB Output is correct
39 Correct 66 ms 151464 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 150932 KB Output is correct
2 Correct 51 ms 150956 KB Output is correct
3 Correct 50 ms 150912 KB Output is correct
4 Correct 50 ms 150996 KB Output is correct
5 Correct 51 ms 150940 KB Output is correct
6 Correct 51 ms 150988 KB Output is correct
7 Correct 51 ms 150932 KB Output is correct
8 Correct 53 ms 150920 KB Output is correct
9 Correct 58 ms 150940 KB Output is correct
10 Correct 51 ms 150980 KB Output is correct
11 Correct 51 ms 150936 KB Output is correct
12 Correct 51 ms 150916 KB Output is correct
13 Correct 51 ms 150944 KB Output is correct
14 Correct 51 ms 150888 KB Output is correct
15 Correct 55 ms 151152 KB Output is correct
16 Correct 51 ms 150988 KB Output is correct
17 Correct 52 ms 150928 KB Output is correct
18 Correct 51 ms 151004 KB Output is correct
19 Correct 51 ms 151000 KB Output is correct
20 Correct 52 ms 150972 KB Output is correct
21 Correct 52 ms 150976 KB Output is correct
22 Correct 53 ms 151292 KB Output is correct
23 Correct 52 ms 150996 KB Output is correct
24 Correct 53 ms 150984 KB Output is correct
25 Correct 52 ms 150980 KB Output is correct
26 Correct 51 ms 150960 KB Output is correct
27 Correct 51 ms 150988 KB Output is correct
28 Correct 52 ms 150960 KB Output is correct
29 Correct 51 ms 150892 KB Output is correct
30 Correct 258 ms 194844 KB Output is correct
31 Correct 260 ms 194812 KB Output is correct
32 Correct 254 ms 194940 KB Output is correct
33 Correct 255 ms 195144 KB Output is correct
34 Correct 254 ms 194888 KB Output is correct
35 Correct 62 ms 152652 KB Output is correct
36 Correct 55 ms 151016 KB Output is correct
37 Correct 54 ms 150964 KB Output is correct
38 Correct 455 ms 195368 KB Output is correct
39 Correct 60 ms 152668 KB Output is correct
40 Correct 65 ms 151892 KB Output is correct
41 Correct 60 ms 151756 KB Output is correct
42 Correct 63 ms 152476 KB Output is correct
43 Correct 63 ms 152496 KB Output is correct
44 Correct 155 ms 169988 KB Output is correct
45 Correct 60 ms 152652 KB Output is correct
46 Correct 60 ms 152652 KB Output is correct
47 Correct 63 ms 152296 KB Output is correct
48 Correct 164 ms 170580 KB Output is correct
49 Correct 56 ms 150956 KB Output is correct
50 Correct 62 ms 152004 KB Output is correct
51 Correct 62 ms 151720 KB Output is correct
52 Correct 66 ms 151464 KB Output is correct
53 Correct 263 ms 170704 KB Output is correct
54 Correct 265 ms 170688 KB Output is correct
55 Correct 452 ms 189384 KB Output is correct
56 Correct 436 ms 189260 KB Output is correct
57 Correct 258 ms 194852 KB Output is correct
58 Correct 257 ms 194444 KB Output is correct
59 Correct 258 ms 194700 KB Output is correct
60 Correct 487 ms 187056 KB Output is correct
61 Correct 133 ms 150992 KB Output is correct
62 Correct 412 ms 179312 KB Output is correct
63 Correct 326 ms 170804 KB Output is correct
64 Correct 239 ms 161464 KB Output is correct