Submission #895095

#TimeUsernameProblemLanguageResultExecution timeMemory
895095hariaakas646Growing Vegetable is Fun 3 (JOI19_ho_t3)C++14
15 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define scd(t) scanf("%d", &t) #define sclld(t) scanf("%lld", &t); #define forr(i, l, r) for(int i=l; i<r; i++) #define frange(i, l) forr(i, 0, l) #define pb push_back #define mp make_pair #define f first #define s second #define all(x) x.begin(), x.end() typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pii> vii; typedef long long lli; typedef vector<vi> vvi; typedef vector<lli> vll; typedef vector<bool> vb; typedef set<int> seti; void usaco() { freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin); } int n; lli dist(string &st1, string &st2) { vi r1, g1, y1, r2, g2, y2; lli tot = 0; frange(i, n) { if(st1[i] == 'R') r1.pb(i); if(st1[i] == 'G') g1.pb(i); if(st2[i] == 'R') r2.pb(i); if(st2[i] == 'G') g2.pb(i); } frange(i, r1.size()) tot += abs(r1[i] - r2[i]); frange(i, g1.size()) tot += abs(g1[i] - g2[i]); return tot/2; } int main() { // usaco(); string str; cin >> n >> str; int rc = 0; int gc = 0; frange(i, n) { if(str[i] == 'R') rc++; else gc++; } if(rc == gc) { string str1, str2; frange(i, n) { if(i % 2) { str1 += 'R'; str2 += 'G'; } else { str1 += 'G'; str2 += 'R'; } } printf("%lld", min(dist(str, str1), dist(str, str2))); } else if(rc == gc+1) { string str1; frange(i, n) { if(i % 2==0) str1 += 'R'; else str1 += 'G'; } printf("%lld", dist(str, str1)); } else if(rc == gc-1) { string str1; frange(i, n) { if(i % 2) str1 += 'R'; else str1 += 'G'; } printf("%lld", dist(str, str1)); } else printf("-1"); }

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'lli dist(std::string&, std::string&)':
joi2019_ho_t3.cpp:7:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define forr(i, l, r) for(int i=l; i<r; i++)
      |                                     ^
joi2019_ho_t3.cpp:8:22: note: in expansion of macro 'forr'
    8 | #define frange(i, l) forr(i, 0, l)
      |                      ^~~~
joi2019_ho_t3.cpp:40:2: note: in expansion of macro 'frange'
   40 |  frange(i, r1.size()) tot += abs(r1[i] - r2[i]);
      |  ^~~~~~
joi2019_ho_t3.cpp:7:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define forr(i, l, r) for(int i=l; i<r; i++)
      |                                     ^
joi2019_ho_t3.cpp:8:22: note: in expansion of macro 'forr'
    8 | #define frange(i, l) forr(i, 0, l)
      |                      ^~~~
joi2019_ho_t3.cpp:41:2: note: in expansion of macro 'frange'
   41 |  frange(i, g1.size()) tot += abs(g1[i] - g2[i]);
      |  ^~~~~~
joi2019_ho_t3.cpp: In function 'void usaco()':
joi2019_ho_t3.cpp:25:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...