Submission #496909

#TimeUsernameProblemLanguageResultExecution timeMemory
496909mansurCoin Collecting (JOI19_ho_t4)C++17
0 / 100
1 ms204 KiB
#include<bits/stdc++.h> #pragma optimize ("g",on) #pragma GCC optimize ("inline") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #pragma GCC optimize ("03") #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native") #pragma comment(linker, "/stack:200000000") //01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001 using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ll long long #define pb push_back #define sz(a) a.size() #define nl '\n' #define popb pop_back() #define ld double #define ull unsigned long long #define ff first #define ss second #define fix fixed << setprecision #define pii pair<int, int> #define E exit (0) #define int long long const int inf = 1e15, N = 1e6 + 1, mod = 998244353; vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; main() { //freopen("cowrect.in", "r", stdin); //freopen("cowrect.out", "w", stdout); ios_base::sync_with_stdio(NULL); cin.tie(NULL); int n; cin >> n; vector<pii> a, b; for (int i = 1, x, y; i <= n * 2; i++) { cin >> x >> y; if (y <= 1) { a.pb({x, y}); }else b.pb({x, y}); } if (sz(a) > n) { sort(all(a)); int mn = inf; for (int l = 0; l <= sz(a) - n; l++) { int cur = 0; for (int r = l; r < l + n; r++) { cur += abs((r - l + 1) - a[r].ff) + 1 - a[r].ss; } vector<pii> s = b; for (int i = 0; i < l; i++) s.pb(a[i]); for (int i = l + n; i < sz(a); i++) s.pb(a[i]); sort(all(s)); for (int i = 0; i < sz(s); i++) { cur += abs(i + 1 - s[i].ff) + abs(2 - s[i].ss); } mn = min(mn, cur); } cout << mn; }else { sort(all(b)); int mn = inf; for (int l = 0; l <= sz(b) - n; l++) { int cur = 0; for (int r = l; r < l + n; r++) { cur += abs((r - l + 1) - b[r].ff) + b[r].ss - 2; } vector<pii> s = a; for (int i = 0; i < l; i++) s.pb(b[i]); for (int i = l + n; i < sz(b); i++) s.pb(b[i]); sort(all(s)); for (int i = 0; i < sz(s); i++) { cur += abs(i + 1 - s[i].ff) + abs(1 - s[i].ss); } mn = min(mn, cur); } cout << mn; } }

Compilation message (stderr)

joi2019_ho_t4.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
joi2019_ho_t4.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
joi2019_ho_t4.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:50:12: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   50 |  if (sz(a) > n) {
      |            ^
joi2019_ho_t4.cpp:53:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   53 |   for (int l = 0; l <= sz(a) - n; l++) {
      |                   ~~^~~~~~~~~~~~
joi2019_ho_t4.cpp:60:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |    for (int i = l + n; i < sz(a); i++) s.pb(a[i]);
      |                          ^
joi2019_ho_t4.cpp:62:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    for (int i = 0; i < sz(s); i++) {
      |                      ^
joi2019_ho_t4.cpp:71:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   71 |   for (int l = 0; l <= sz(b) - n; l++) {
      |                   ~~^~~~~~~~~~~~
joi2019_ho_t4.cpp:78:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |    for (int i = l + n; i < sz(b); i++) s.pb(b[i]);
      |                          ^
joi2019_ho_t4.cpp:80:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |    for (int i = 0; i < sz(s); i++) {
      |                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...