Submission #1294603
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
vector<string> split(string s, char c) {
vector<string> ret;
string temp;
replace(s.begin(), s.end(), c, ' ');
stringstream ss(s);
while(ss >> temp) ret.pb(temp);
return ret;
}
signed main() {
string s; getline(cin, s);
vector<string> vs = split(s, ' ');
reverse(vs.begin(), vs.end());
string dummy = "###";
string prev = dummy;
vector<string> ans;
int cnt = 0;
rep(i,0,vs.size()) {
if(vs[i] == "not") {
cnt++;
if(cnt == 2) {
if(prev == dummy) {
rep(x,0,2) ans.push_back("not");
}
cnt = 0;
}
}
else {
rep(x,0,cnt) ans.push_back("not");
cnt = 0;
ans.push_back(vs[i]);
prev = vs[i];
}
}
rep(x,0,cnt) ans.push_back("not");
reverse(ans.begin(), ans.end());
rep(i,0,ans.size()) {
if(i == 0) cout << ans[i];
else cout << " " << ans[i];
}
cout << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 二重否定除去法則 |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2893 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
384 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt |
Case Name |
Status |
Exec Time |
Memory |
scrambled_00.txt |
AC |
1 ms |
256 KB |
scrambled_01.txt |
AC |
1 ms |
256 KB |
scrambled_02.txt |
AC |
1 ms |
256 KB |
scrambled_03.txt |
AC |
1 ms |
256 KB |
scrambled_04.txt |
AC |
1 ms |
256 KB |
scrambled_05.txt |
AC |
2 ms |
384 KB |
scrambled_06.txt |
AC |
2 ms |
384 KB |
scrambled_07.txt |
AC |
2 ms |
384 KB |
scrambled_08.txt |
AC |
2 ms |
384 KB |
scrambled_09.txt |
AC |
1 ms |
256 KB |
scrambled_10.txt |
AC |
1 ms |
256 KB |
scrambled_11.txt |
AC |
1 ms |
256 KB |
scrambled_12.txt |
AC |
1 ms |
256 KB |
scrambled_13.txt |
AC |
2 ms |
256 KB |
scrambled_14.txt |
AC |
2 ms |
256 KB |
scrambled_15.txt |
AC |
2 ms |
256 KB |
scrambled_16.txt |
AC |
2 ms |
256 KB |
scrambled_17.txt |
AC |
2 ms |
256 KB |
scrambled_18.txt |
AC |
2 ms |
256 KB |