| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1087287 |
2024-09-12T12:32:32 Z |
vyshniak_n |
Ili (COI17_ili) |
C++17 |
|
1 ms |
1372 KB |
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2,tune=native")
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
#include <random>
mt19937 rnd(time(0));
const ll INF = 2e18 + 10;
const ll inf = 2e9 + 10;
const ll N = 4e4 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 10;
vector <ll> gr[N];
string s;
void solve() {
ll n, m;
cin >> n >> m;
cin >> s;
string nw = "?";
for (ll i = 1; i <= n; i++)
nw += '?';
nw += s;
s = nw;
for (ll i = 1; i <= m; i++) {
string a, b;
cin >> a >> b;
ll l = 0, r = 0;
for (ll i = 1; i < a.size(); i++)
l *= 10, l += a[i] - '0';
for (ll i = 1; i < b.size(); i++)
r *= 10, r += b[i] - '0';
if (a[0] == 'c') l += n;
if (b[0] == 'c') r += n;
if (l == r) {
gr[i + n].pb(l);
continue;
}
gr[i + n].pb(l);
gr[i + n].pb(r);
}
for (ll steps = 0; steps < n + m; steps++) {
if (steps % 2 == 0) {
for (ll i = n + m; i > n; i--) {
if (s[i] == '?')
continue;
if (s[i] == '0') {
if (gr[i].size() == 1) {
s[gr[i][0]] = '0';
continue;
}
s[gr[i][0]] = '0';
s[gr[i][1]] = '0';
} else {
if (gr[i].size() == 1) {
s[gr[i][0]] = '1';
continue;
}
if (s[gr[i][0]] == '0')
s[gr[i][1]] = '1';
else if (s[gr[i][1]] == '0')
s[gr[i][0]] = '1';
}
}
} else {
for (ll i = n + 1; i <= n + m; i++) {
if (s[i] != '?')
continue;
if (gr[i].size() == 1) {
s[i] = s[gr[i][0]];
continue;
}
if (s[gr[i][0]] == '0' && s[gr[i][1]] == '0')
s[i] = '0';
if (s[gr[i][0]] == '1' || s[gr[i][1]] == '1')
s[i] = '1';
}
}
}
for (ll i = n + 1; i <= n + m; i++)
cout << s[i];
cout << el;
return;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
int tests = 1;
//cin >> tests;
while (tests--)
solve();
return 0;
}
/*
*/
Compilation message
ili.cpp: In function 'void solve()':
ili.cpp:83:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for (ll i = 1; i < a.size(); i++)
| ~~^~~~~~~~~~
ili.cpp:85:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for (ll i = 1; i < b.size(); i++)
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1372 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
