oj.uz

답안 #468548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468548 2021-08-28T17:12:29 Z Carmel_Ab1 XORanges (eJOI19_xoranges) C++17
55 / 100
 1000 ms 1212 KB 
    #include<bits/stdc++.h>
    //#include <ext/pb_ds/assoc_container.hpp>
    //#include <ext/pb_ds/tree_policy.hpp>

    //using namespace __gnu_pbds;
    using namespace std;

    typedef long double ld;
    typedef long long ll;
    typedef unsigned long long ull;
    typedef vector<int> vi;
    typedef vector<vector<int>> vvi;
    typedef vector<ll> vl;
    typedef vector<vl> vvl;
    typedef pair<int, int> pi;
    typedef pair<ll, ll> pl;
    typedef vector<pl> vpl;
    typedef vector<ld> vld;
    typedef pair<ld, ld> pld;

    //typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
    template<typename T>
    ostream &operator<<(ostream &os, vector<T> &a) {
        os << "[";
        for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
        os << "]\n";
        return os;
    }

    #define all(x) x.begin(),x.end()
    #define YES out("YES")
    #define NO out("NO")
    #define out(x){cout << x << "\n"; return;}
    #define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
    #define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
    #define pb push_back
    #define umap unordered_map

    template<typename T1, typename T2>
    istream &operator>>(istream &is, pair<T1, T2> &p) {
        is >> p.first >> p.second;
        return is;
    }

    template<typename T1, typename T2>
    ostream &operator<<(ostream &os, pair<T1, T2> &p) {
        os << "" << p.first << " " << p.second << "";
        return os;
    }

    void usaco(string taskname) {
        string fin = taskname + ".in";
        string fout = taskname + ".out";
        const char *FIN = fin.c_str();
        const char *FOUT = fout.c_str();
        freopen(FIN, "r", stdin);
        freopen(FOUT, "w", stdout);
    }

    template<typename T>
    void read(vector<T> &v) {
        int n = v.size();
        for (int i = 0; i < n; i++)
            cin >> v[i];
    }

    template<typename T>
    vector<T> UNQ(vector<T> a) {
        vector<T> ans;
        for (T t:a)
            if (ans.empty() || t != ans.back())
                ans.push_back(t);
        return ans;
    }

    ll ceil(ll a, ll b) {
        ll ans = a / b;
        if (a % b)ans++;
        return ans;
    }

    ld log(ld a, ld b) { return log(b) / log(a); }

    ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
        ll ans = 1;
        while (exp) {
            if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
            base = ((base % M) * (base % M)) % M;
            exp /= 2;
        }
        return ans;
    }

    string to_base(int n, int new_base) {
        string s;
        int nn = n;
        while (nn) {
            s += to_string(nn % new_base);
            nn /= new_base;
        }
        reverse(all(s));
        return s;
    }

    ll gcd(ll a, ll b) {
        if (a < b)swap(a, b);
        if (b == 0)return a;
        return gcd(b, a % b);
    }

    ll lcm(ll a, ll b) {
        ll x = (a / gcd(a, b));
        return b * x;
    }

    vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
        if (mx == 1e18 + 1)
            mx = n;
        vl ans(n);
        for (int i = 0; i < n; i++)
            ans[i] = (mn + rand() % (mx - mn + 1));
        return ans;
    }

    string substr(string s, int l, int r) {
        string ans;
        for (int i = l; i <= r; i++)
            ans += s[i];
        return ans;
    }


    void solve();

    int main() {
        GLHF;
        int t = 1;
        //cin >> t;
        while (t--)
            solve();
    }

    void solve() {
        int n,q;
        cin >> n >> q;
        vi a(n);
        read(a);

        while(q--){
            int op,l,r;
            cin >> op >> l >> r;
            l--,r--;
            if(op==1){
                a[l]=r+1;
                continue;
            }
            if((r-l+1)%2==0){
                cout << "0\n";
                continue;
            }
            int ans=0;
            for(int i=l; i<=r; i++){
                if(((i-l+1)%2)*((r-i+1)%2))
                    ans^=a[i];
            }
            cout << ans << "\n";
        }
    }

Compilation message

xoranges.cpp: In function 'void solve()':
xoranges.cpp:163:31: warning: '*' in boolean context, suggest '&&' instead [-Wint-in-bool-context]
  163 |                 if(((i-l+1)%2)*((r-i+1)%2))
      |                    ~~~~~~~~~~~^~~~~~~~~~~~
xoranges.cpp: In function 'void usaco(std::string)':
xoranges.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen(FIN, "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~
xoranges.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(FOUT, "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
18.0 / 18.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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 19 ms 356 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 1212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 19 ms 356 KB Output is correct
15 Execution timed out 1091 ms 1212 KB Time limit exceeded
16 Halted 0 ms 0 KB -