Submission #1231002
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef complex<double> point; #define xx real() #define yy imag() #define REP(i, a, b) for(int i = (a); i < (int)(b); i++) #define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++) #define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++) #define SZ(x) (int)(x).size() #define BE(x) (x).begin(), (x).end() #define SORT(x) sort(BE(x)) #define _1 first #define _2 second #define x1 gray_cat_x1 #define y1 gray_cat_y1 template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } #define file "cycle" const double EPS = 1e-9; const double PI = acos(-1.); const int INF = 1e9; const ll MOD = 1e9 + 7; const int MAXN = 2e5 + 5; char s[MAXN]; char ans[MAXN]; int ans_len; void solve(){ scanf("%s", &s[0]); for(int i = 0; s[i]; i++){ ans[ans_len++] = s[i]; if (ans_len >= 2 && ans[ans_len - 2] == 'S' && ans[ans_len - 1] == 'T'){ ans_len -= 2; } } printf("%d\n", ans_len); } int main(){ //freopen(file".in", "r", stdin); freopen(file".out", "w", stdout); int t = 1; //cin >> t; while(t--){ solve(); } }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | Timur_Sitdikov |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1283 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:41:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", &s[0]); ^
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2 |
Subtask1 | example0, example1, example2, sub_corner0, sub_corner1, sub_corner2, sub_rand0, handmade0, handmade1 |
All | corner0, corner1, corner2, example0, example1, example2, handmade0, handmade1, maxrand0, sub_corner0, sub_corner1, sub_corner2, sub_rand0 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner0 | AC | 2 ms | 512 KB |
corner1 | AC | 2 ms | 640 KB |
corner2 | AC | 2 ms | 512 KB |
example0 | AC | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
handmade0 | AC | 1 ms | 256 KB |
handmade1 | AC | 1 ms | 256 KB |
maxrand0 | AC | 3 ms | 384 KB |
sub_corner0 | AC | 1 ms | 256 KB |
sub_corner1 | AC | 1 ms | 256 KB |
sub_corner2 | AC | 1 ms | 256 KB |
sub_rand0 | AC | 1 ms | 256 KB |