oj.uz

답안 #420279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420279 2021-06-08T08:52:09 Z acm Xor Sort (eJOI20_xorsort) C++14
25 / 100
 152 ms 12584 KB 
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
int n, s, a[1005];
vector<pair<int, int>> v;
int main() {
  speed;
  precision;
  // code
  cin >> n >> s;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  while (true) {
    int ok = 1;
    for (int i = 1; i < n; i++) {
      if (a[i] > a[i + 1]) {
        v.pb(mp(i + 1, i));
        v.pb(mp(i, i + 1));
        v.pb(mp(i + 1, i));
        a[i + 1] ^= a[i];
        a[i] ^= a[i + 1];
        a[i + 1] ^= a[i];
        ok = 0;
      }
    }
    if (ok) break;
  }
  cout << sz(v) << "\n";
  for (auto x : v) cout << x.F << " " << x.S << "\n";
    // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

xorsort.cpp: In function 'void ioi(std::string)':
xorsort.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 720 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 4 ms 704 KB Output is correct
9 Correct 4 ms 656 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 976 KB Output is correct
13 Correct 7 ms 976 KB Output is correct
14 Correct 7 ms 976 KB Output is correct
15 Correct 7 ms 976 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 720 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 4 ms 704 KB Output is correct
9 Correct 4 ms 656 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 976 KB Output is correct
13 Correct 7 ms 976 KB Output is correct
14 Correct 7 ms 976 KB Output is correct
15 Correct 7 ms 976 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 4 ms 720 KB Output is correct
18 Correct 6 ms 848 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 848 KB Output is correct
21 Correct 6 ms 848 KB Output is correct
22 Correct 6 ms 848 KB Output is correct
23 Correct 6 ms 848 KB Output is correct
24 Correct 6 ms 848 KB Output is correct
25 Correct 8 ms 852 KB Output is correct
26 Incorrect 12 ms 1228 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 848 KB Output is correct
5 Incorrect 152 ms 12584 KB Integer 764742 violates the range [0, 40000]
6 Halted 0 ms 0 KB -