이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define Y8o "lamps"
#define maxn 1000005
#define ll long long
#define pii pair<int, int>
#define gb(i, j) ((i >> j) & 1)
using namespace std;
/// okay?
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r) {
return uniform_int_distribution<ll> (l, r) (rng);
}
void iof() { /// ------------------inp_out file!-----------------///
if(fopen(Y8o".inp", "r"))
{
freopen(Y8o".inp", "r", stdin);
// freopen(Y8o".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void ctime() { /// ------------------check time!-----------------///
cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
/// okay!
int n;
int demt[maxn], dp[maxn], dem0[maxn];
string s1, s2;
void solve()
{
cin >> n;
cin >> s1 >> s2, s1 = ' ' + s1, s2 = ' ' + s2;
for(int i = 1; i <= n; i ++)
{
demt[i] = demt[i - 1] + (s1[i] == s2[i]);
dem0[i] = dem0[i - 1] + (s2[i] == '0');
dp[i] = 1e9;
}
for(int i = 1; i <= n; i ++)
{
for(int j = 0; j <= i - 1; j ++)
{
/// TH1 : giongnhau
if(demt[i] - demt[j] == i - j) dp[i] = dp[j];
else
{
int slans0 = dem0[i] - dem0[j];
int slans1 = (i - j) - slans0;
int same = demt[i] - demt[j];
dp[i] = min(dp[i], dp[j] + 1 + slans1); /// off then turn some lamps
dp[i] = min(dp[i], dp[j] + 1 + slans0); /// on then off sonme lamps
dp[i] = min(dp[i], dp[j] + same + 1); /// togle
}
}
}
cout << dp[n];
}
int main()
{
iof();
int nTest = 1;
// cin >> nTest;
while(nTest --) {
solve();
}
ctime();
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
lamp.cpp: In function 'void iof()':
lamp.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
18 | freopen(Y8o".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |